#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &x : v) is >> x;
  return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < v.size(); ++i) {
    os << v[i] << (i + 1 == v.size() ? '\n' : ' ');
  }
  return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  cout << '(' << p.first << ',' << p.second << ')';
  return os;
}
template <class T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
long long k;
long long po[10];
long long sum(long long n) {
  string s = to_string(n);
  int d = s.size();
  long long res = 0;
  for (int i = 1; i <= d; ++i) {
    if (i < d)
      res += 9 * po[i - 1] * i;
    else
      res += (n - po[d - 1] + 1) * d;
  }
  return res;
}
long long allsum(long long n) {
  string s = to_string(n);
  int d = s.size();
  long long res = 0;
  for (int i = 1; i <= d; ++i) {
    if (i < d) {
      res += i * (po[i] - po[i - 1] + 1) * (po[i] - po[i - 1]) / 2;
      res += sum(po[i - 1] - 1) * (po[i] - po[i - 1]);
    } else {
      res += i * (n - po[i - 1] + 2) * (n - po[i - 1] + 1) / 2;
      res += sum(po[i - 1] - 1) * (n - po[i - 1] + 1);
    }
  }
  return res;
}
void solve() {
  long long lb = 0, ub = 1e9;
  while (ub - lb > 1) {
    long long mid = (ub + lb) >> 1LL;
    (allsum(mid) <= k ? lb : ub) = mid;
  }
  k -= allsum(lb);
  lb = 0, ub = 1e9;
  while (ub - lb > 1) {
    long long mid = (ub + lb) >> 1LL;
    (sum(mid) <= k ? lb : ub) = mid;
  }
  k -= sum(lb);
  string ans = to_string(ub);
  cout << ans[k] << '\n';
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  po[0] = 1;
  for (int i = 0; i < 9; ++i) po[i + 1] = po[i] * 10;
  int q;
  cin >> q;
  for (; q--;) {
    cin >> k;
    --k;
    solve();
  }
}
