/*

ID: LinKArftc

PROG: 1019.cpp

LANG: C++

*/

#include <map>

#include <set>

#include <cmath>

#include <stack>

#include <queue>

#include <vector>

#include <cstdio>

#include <string>

#include <utility>

#include <cstdlib>

#include <cstring>

#include <iostream>

#include <algorithm>

using namespace std;

#define eps 1e-8

#define randin srand((unsigned int)time(NULL))

#define input freopen("input.txt","r",stdin)

#define debug(s) cout << "s = " << s << endl;

#define outstars cout << "*************" << endl;

const double PI = acos(-1.0);

const int inf = 0x3f3f3f3f;

const int INF = 0x7fffffff;

typedef long long ll;

const int maxn = ;

ll sum[maxn], line[maxn];//分别是前i行的位数和，第i行的位数

int getbit(int x) {

    return (int)log10((double)x) + ;

}

void init() {

    sum[] = line[] = ;

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

        line[i] = line[i-] + getbit(i);

        sum[i] = sum[i-] + line[i];

    }

}

int getpos(int x, int pos) {

    int len = getbit(x);

    for (int i = ; i <= len - pos; i ++) x /= ;

    return x % ;

}

int main() {

    init();

    int T;

    ll n;

    scanf("%d", &T);

    while (T --) {

        scanf("%lld", &n);

        int cur = ;

        while (sum[cur] < n) cur ++;

        ll pos = n - sum[cur-];

        while (cur >= ) {

            if (pos > line[cur-]) {

                pos -= line[cur-];

                printf("%d\n", getpos(cur, pos));

                break;

            } else cur --;

        }

    }

    return ;

}