class Solution {

    /*

     * param k : As description.

     * param n : As description.

     * return: An integer denote the count of digit k in 1..n

     */

    public int digitCounts(int k, int n) {

        int totalCount = ;

        for (int i = ; i <= n; i++) {

            totalCount += counts(k, i);

        }

        return totalCount;

    }

    public int counts(int k, int value) {

        int count = ;

        if (value ==  && k == ) return ;

        while (value != ) {

            int remainder = value % ;

            if (remainder == k) {

                count++;

            }

            value = value / ;

        }

        return count;

    }

};