#include <bits/stdc++.h>
using namespace std;
string s0 =
    "What are you doing at the end of the world? Are you busy? Will you save "
    "us?";
string chuoi[3] = {"What are you doing while sending \"",
                   "\"? Are you busy? Will you send \"", "\"?"};
long long f[100010];
int itest, ntest;
int n;
long long vt;
char kq;
void precal() {
  int i;
  f[0] = 75;
  for (i = 1; i <= 100000; i++) {
    f[i] = 0;
    if (f[i - 1] == -1) {
      f[i] = -1;
    } else {
      f[i] += chuoi[0].length() + f[i - 1] + chuoi[1].length() + f[i - 1] +
              chuoi[2].length();
      if (f[i] > (long long)1000000000000000000) {
        f[i] = -1;
      }
    }
  }
}
void xetkq() {
  int i, j;
  int dk;
  dk = 0;
  for (i = n; i >= 1; i--) {
    for (j = 0; j < 3; j++) {
      if (j != 0) {
        if (f[i - 1] == -1 || f[i - 1] >= vt) {
          dk = 1;
          break;
        } else {
          vt -= f[i - 1];
        }
      }
      if (vt <= chuoi[j].length()) {
        kq = chuoi[j][vt - 1];
        return;
      }
      vt = vt -= chuoi[j].length();
    }
    if (i == n && dk == 0) {
      kq = '.';
      return;
    }
  }
  kq = s0[vt - 1];
}
void solve() {
  if (n == 0) {
    if (vt > s0.length()) {
      kq = '.';
    } else {
      kq = s0[vt - 1];
    }
  } else {
    xetkq();
  }
}
void output() { printf("%c", kq); }
int main() {
  precal();
  scanf("%d", &ntest);
  for (itest = 0; itest < ntest; itest++) {
    scanf("%d %I64d", &n, &vt);
    solve();
    output();
  }
  printf("\n");
  return 0;
}
