#include <bits/stdc++.h>   using namespace std;   const int INF = 0x3f3f3f3f;   int main() {     long long k;     long long now = 9;     long long last = 1;     cin >> k;     if (k <= 9) {       cout << k;       return 0;     }     long long finalk = k;     long long pow = 1;     for (int step = 1; step <= 15; step++) {       long long tmplast = last - 1;       if (k <= now) {         long long this_num = tmplast + (k / step);         bool OK = 1;         long long tmpnum = this_num;         for (int i = 1; i <= step; i++) {           if (tmpnum % 10 != 9) OK = false;           tmpnum /= 10;         }         if (OK) step++;         if (k % step) this_num += 1;         long long yiwei = (step - k % step);         if (yiwei == step) yiwei = 0;         for (int i = 1; i <= yiwei; i++) {           this_num /= 10;         }         printf( %d n , this_num % 10);         return 0;       }       k -= now;       pow *= 10;       now = 9 * pow;       now *= (step + 1);       last *= 10;     }     return 0;   }   