class Solution {

  public:

     // param k : description of k

     // param n : description of n

     // return ans a integer

     int digitCounts(int k, int n) {

         int count = ;

         if (k == ) {

             count = ;

         }

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

             int number = i;

             while (number > ) {

                 if (number %  == k) {

                     count += ;

                 }

                 number /= ;

             }

         }

         return count;

     }

 };