#include <bits/stdc++.h>
using namespace std;
const long long INFL = 1LL << 60;
const long long INF = INFL;
long long MOD = 1000000007;
vector<long long> dy = {0, -1, 0, 1, 1, 1, -1, -1, 0};
vector<long long> dx = {1, 0, -1, 0, 1, -1, 1, -1, 0};
void pres(double A) { cout << fixed << setprecision(10) << A << endl; }
void BinarySay(long long x, long long y = 60) {
  for (long long i = 0; i < (y); i++) cout << (x >> (y - 1 - i) & 1);
  cout << endl;
}
long long get_bit(long long x) { return __builtin_popcountll(x); }
long long pow_long(long long x, long long k) {
  long long res = 1;
  while (k > 0) {
    if (k % 2) res *= x;
    x *= x;
    k /= 2;
  }
  return res;
}
long long pow_mod(long long x, long long k) {
  long long res = 1;
  while (k > 0) {
    if (k % 2) {
      res *= x;
      res %= MOD;
    }
    x *= x;
    x %= MOD;
    k /= 2;
  }
  return res;
}
long long inverse(long long x) { return pow_mod(x, MOD - 2); };
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; };
long long kai_mod(long long x) {
  if (x == 0) return 1;
  return x * kai_mod(x - 1) % MOD;
}
vector<long long> divisor(long long n) {
  vector<long long> res(0);
  for (long long i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      res.push_back(i);
      if (i != n / i) res.push_back(n / i);
    }
  }
  sort(res.begin(), res.end());
  return res;
}
vector<long long> MakePrimeList(long long x) {
  vector<long long> res;
  for (long long k = 2; k * k <= x; k++) {
    if (x % k == 0) {
      res.push_back(k);
      while (x % k == 0) x /= k;
    }
  }
  if (x > 1) res.push_back(x);
  return res;
}
const int MAXcomb = 200010;
long long fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
void COMinit() {
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAXcomb; i++) {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}
long long comb(int n, int k) {
  if (n < k) return 0;
  if (n < 0 || k < 0) return 0;
  return fac[n] * finv[k] % MOD * finv[n - k] % MOD;
}
void solve() {
  vector<long long> sum(10);
  for (long long i = 0; i < (10); i++) {
    long long second = 0;
    for (long long j = 1; j < i; j++) {
      second += j * 9 * pow_long(10, j - 1);
    }
    second *= 9 * pow_long(10, i - 1);
    second += i * 9 * pow_long(10, i - 1) * (9 * pow_long(10, i - 1) + 1) / 2;
    sum[i] = second;
  }
  for (long long i = 0; i < (9); i++) {
    sum[i + 1] += sum[i];
  }
  long long T;
  cin >> T;
  for (long long _ = 0; _ < (T); _++) {
    long long k;
    cin >> k;
    if (k == 0) continue;
    long long t;
    for (long long j = 0; j < (10); j++) {
      if (k <= sum[j]) {
        t = j - 1;
        break;
      }
    }
    k -= sum[t];
    t++;
    long long second = 0;
    for (long long j = 1; j < t; j++) {
      second += j * 9 * pow_long(10, j - 1);
    }
    long long ok = 0, ng = 9 * pow_long(10, t - 1);
    while (ng - ok > 1) {
      long long mid = (ok + ng) / 2;
      if (second * mid + t * mid * (mid + 1) / 2 < k) {
        ok = mid;
      } else {
        ng = mid;
      }
    }
    k -= second * ok + t * ok * (ok + 1) / 2;
    k--;
    for (long long j = 1; j < 20; j++) {
      if (k >= j * 9 * pow_long(10, j - 1)) {
        k -= j * 9 * pow_long(10, j - 1);
      } else {
        t = j;
        break;
      }
    }
    long long x = pow_long(10, t - 1) + (k / t);
    k %= t;
    string X = to_string(x);
    cout << X[k] << endl;
  }
}
long long keta(long long x) {
  long long res = 0;
  while (x) {
    res++;
    x /= 10;
  }
  return res;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  solve();
}
