#include <bits/stdc++.h>
using namespace std;
string f0 =
    "What are you doing at the end of the world? Are you busy? Will you save "
    "us?";
string f10 = "What are you doing while sending \"";
string f11 = "\"? Are you busy? Will you send \"";
string f12 = "\"?";
int l0 = f0.length(), l10 = f10.length(), l11 = f11.length(),
    l12 = f12.length();
long long f[] = {75,
                 218,
                 504,
                 1076,
                 2220,
                 4508,
                 9084,
                 18236,
                 36540,
                 73148,
                 146364,
                 292796,
                 585660,
                 1171388,
                 2342844,
                 4685756,
                 9371580,
                 18743228,
                 37486524,
                 74973116,
                 149946300,
                 299892668,
                 599785404,
                 1199570876,
                 2399141820,
                 4798283708,
                 9596567484,
                 19193135036,
                 38386270140,
                 76772540348,
                 153545080764,
                 307090161596,
                 614180323260,
                 1228360646588,
                 2456721293244,
                 4913442586556,
                 9826885173180,
                 19653770346428,
                 39307540692924,
                 78615081385916,
                 157230162771900,
                 314460325543868,
                 628920651087804,
                 1257841302175676,
                 2515682604351420,
                 5031365208702908,
                 10062730417405884,
                 20125460834811836,
                 40250921669623740,
                 80501843339247548,
                 161003686678495164,
                 322007373356990396,
                 644014746713980860,
                 1288029493427961788};
const long long K_MAX = 1000000000000000000;
long long f_length(int n) {
  if (n <= 52)
    return f[n];
  else
    return K_MAX;
}
void find_char(int n, long long k) {
  if (n == 0) {
    if (k <= l0)
      cout << f0[k];
    else
      cout << ".";
    return;
  } else if (k < l10)
    cout << f10[k];
  else if (l10 <= k & k < l10 + f_length(n - 1))
    find_char(n - 1, k - l10);
  else if (l10 + f_length(n - 1) <= k & k < l10 + l11 + f_length(n - 1))
    cout << f11[k - l10 - f_length(n - 1)];
  else if (l10 + l11 + f_length(n - 1) <= k &
           k < l10 + l11 + 2 * f_length(n - 1))
    find_char(n - 1, k - l10 - l11 - f_length(n - 1));
  else if (l10 + l11 + 2 * f_length(n - 1) <= k &
           k < l10 + l11 + l12 + 2 * f_length(n - 1))
    cout << f12[k - l10 - l11 - 2 * f_length(n - 1)];
  else
    cout << ".";
}
int main() {
  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    int n;
    long long k;
    cin >> n >> k;
    find_char(n, k - 1);
  }
  long long nr = 1;
  return 0;
}
