#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const double eps = 1e-6;
const int MAXN = 1e3 + 10;
const int MAXM = 2e6 + 10;
const long long mod = 1e9 + 7;
string s0 =
    "What are you doing at the end of the world? Are you busy? Will you save "
    "us?";
string s1 =
    "What are you doing while sending \"What are you doing at the end of the "
    "world? Are you busy? Will you save us?\"? Are you busy? Will you send "
    "\"What are you doing at the end of the world? Are you busy? Will you save "
    "us?\"?";
string s2 = "What are you doing while sending \"";
string s3 = "\"? Are you busy? Will you send \"";
string s4 = "\"?";
long long a[60] = {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};
void dfs(int n, long long k) {
  if (n > 53) {
    long long pos = (long long)(n - 53) * (long long)(s2.size());
    if (pos >= k) {
      k %= (s2.size());
      k--;
      k += s2.size();
      k %= (s2.size());
      printf("%c", s2[k]);
      return;
    } else {
      dfs(53, k - pos);
      return;
    }
  }
  if (n == 0) {
    if (s0.size() >= k)
      printf("%c", s0[k - 1]);
    else
      printf(".");
    return;
  } else {
    if (s2.size() >= k) {
      printf("%c", s2[k - 1]);
      return;
    } else if (s2.size() + a[n - 1] >= k) {
      dfs(n - 1, k - s2.size());
      return;
    } else if (s2.size() + a[n - 1] + s3.size() >= k) {
      k -= (s2.size() + a[n - 1]);
      printf("%c", s3[k - 1]);
      return;
    } else if (s2.size() + a[n - 1] + s3.size() + a[n - 1] >= k) {
      dfs(n - 1, k - s2.size() - a[n - 1] - s3.size());
      return;
    } else if (s2.size() + a[n - 1] + s3.size() + a[n - 1] + s4.size() >= k) {
      k -= (s2.size() + a[n - 1] + s3.size() + a[n - 1]);
      printf("%c", s4[k - 1]);
      return;
    } else {
      printf(".");
      return;
    }
  }
}
int main() {
  int q;
  scanf("%d", &q);
  while (q--) {
    int n;
    long long k;
    scanf("%d%lld", &n, &k);
    dfs(n, k);
  }
  return 0;
}
