class Solution {
    
    
public:
    typedef long long ll;
    ll count(ll a, ll n) {
    
    
        ll b = a + 1, cnt = 0;
        for(; a <= n; a *= 10, b *= 10) {
    
    
            cnt += min(n + 1, b) - a;
        }
        return cnt;
    }
    int findKthNumber(int n, int k) {
    
    
        int i = 1, j = 1;
        while(i < k) {
    
    
            int cnt = count(j, n);
            if(i + cnt <= k) {
    
    
                j++;
                i += cnt;
            }
            else if(i + cnt > k){
    
    
                j *= 10;
                i++;
            }
        }
        return j;
    }
};