/*
#include <iostream>
#include <string>
using namespace std;
int main()
{
string input = "";
cin >> input;
bool modifyDone = false, modified = false, deleteNext = false;
string output = "";
char lastChar = ' ';
while (!modifyDone)
{
lastChar = ' ';
output = "";
deleteNext = false;
modified = false;
for (unsigned int i = 0; i < input.length(); i++)
{
if (i != 0)
{
if (input[i] == lastChar && (!modified || deleteNext))
{
if (!deleteNext)
{
output.pop_back();
deleteNext = true;
modified = true;
}
}
else
{
deleteNext = false;
output += input[i];
lastChar = input[i];
}
}
else
{
lastChar = input[i];
output += input[i];
}
}
if (!modified || output.length() <= 0)
{
modifyDone = true;
}
else
{
input = output;
}
}
cout << output << "\n";
int a;
cin >> a;
return 0;
}*/
//Tehtävä 1
/*
#include <iostream>
#include <string>
#include <math.h>
using namespace std;
int main()
{
unsigned int q = 0;
cin >> q;
string input[512];
string output[512];
input[0] = "#";
output[0] = "#";
for (unsigned int i = 2; i <= q; i++)
{
unsigned int power = pow(2, i - 1);
for (unsigned int o = 0; o < power / 2; o++)
{
output[o] = input[o] + input[o];
}
for (unsigned int o = power / 2; o < power; o++)
{
output[o] = input[o - (power / 2)];
for (unsigned int p = 0; p < power / 2; p++)
{
if (output[o][p] == '#')
{
output[o] += ".";
}
else
{
output[o] += "#";
}
}
}
for (unsigned int o = 0; o < output->size(); o++)
{
input[o] = output[o];
}
}
for (int i = 0; i < pow(2, q - 1); i++)
{
cout << output[i] << "\n";
}
int a;
cin >> a;
return 0;
}*/
//Tehtävä 2
#include <iostream>
#include <string>
#include <vector>
#include <math.h>
using namespace std;
int main()
{
unsigned int q = 0;
cin >> q;
for (unsigned int i = 0; i < q; i++)
{
unsigned long long int k = 0;
cin >> k;
unsigned int num = k;
unsigned long long int digs = 0;
while (num > 0)
{
num = num / 10;
digs++;
}
unsigned long long int digsBefore = 0;
unsigned long long int numsBefore = 0;
if (digs > 1)
{
digsBefore += 1 * 9 * pow(10, 1 - 1);
for (unsigned long long int o = 2; o < digs; o++)
{
if (digsBefore + o * 9 * pow(10, o - 1) < k)
{
digsBefore += o * 9 * pow(10, o - 1);
//numsBefore = pow(10, o - 1) - 1;
}
else
{
digs--;
}
}
}
unsigned long long int output = (k - 1 - digsBefore) / digs;
//output = output + numsBefore;
//vector<unsigned long long int> digits;
string digits = to_string(output + numsBefore);
/*
while (lK > 0)
{
digits.push_back(lK % 10);
lK /= 10;
}*/
unsigned int mod = ((k - digsBefore) % digs);
if (mod == 0)
{
mod = 3;
}
cout << digits[mod - 1] << "\n";
}
int a = 0;
cin >> a;
return 0;
}
//Tehtävä 3
/*
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <unordered_set>
using namespace std;
int main()
{
string rows[10];
for (int i = 0; i < 10; i++)
{
for (int o = 0; o < 10; o++)
{
int n = i + o;
n = i + o;
while (n > 9)
{
n -= 10;
}
rows[i] += to_string(n);
if (i < 10 / 2)
{
n = o - i;
while (n < 0)
{
n += 10;
}
}
else
{
n = o - i + 1;
while (n < 0)
{
n += 10;
}
}
if (n == 0)
{
rows[i] += "A";
}
else if (n == 1)
{
rows[i] += "B";
}
else if (n == 2)
{
rows[i] += "C";
}
else if (n == 3)
{
rows[i] += "D";
}
else if (n == 4)
{
rows[i] += "E";
}
else if (n == 5)
{
rows[i] += "F";
}
else if (n == 6)
{
rows[i] += "G";
}
else if (n == 7)
{
rows[i] += "H";
}
else if (n == 8)
{
rows[i] += "I";
}
else if (n == 9)
{
rows[i] += "J";
}
if (o != 9)
{
rows[i] += " ";
}
}
cout << rows[i] << "\n";
}
ofstream myfile;
myfile.open("Eppapeli.txt");
if (myfile.is_open())
{
for (int i = 0; i < 10; i++)
{
if (i != 10 - 1)
{
myfile << rows[i] + "\n";
}
else
{
myfile << rows[i];
}
}
myfile.close();
}
int a;
cin >> a;
return 0;
}*/
//Tehtävä 5