#include <bits/stdc++.h>
using namespace std;
inline bool chkmin(int &a, int b) { return b < a ? a = b, 1 : 0; }
inline bool chkmax(int &a, int b) { return b > a ? a = b, 1 : 0; }
inline int read() {
  int x = 0, fh = 1;
  char ch = getchar();
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') fh = -1;
  for (; isdigit(ch); ch = getchar()) x = (x << 1) + (x << 3) + (ch ^ '0');
  return x * fh;
}
string f0 =
    "What are you doing at the end of the world? Are you busy? Will you save "
    "us?";
string pre = "What are you doing while sending ";
string mid = "? Are you busy? Will you send ";
string suf = "?";
int pre_len, mid_len, suf_len, extra;
long long len[100100];
void Init() {
  char yh = 34;
  pre = pre + yh;
  mid = yh + mid + yh;
  suf = yh + suf;
  len[0] = f0.size();
  pre_len = pre.size();
  mid_len = mid.size();
  suf_len = suf.size();
  extra = pre_len + mid_len + suf_len;
}
const int N = 12;
int q;
long long ln[N], lk[N];
long long maxk;
int maxn, n;
long long k;
bool Out = false;
void Dfs(int dep) {
  if (Out) return;
  if (!dep) {
    Out = true;
    putchar(f0[k - 1]);
    return;
  }
  if (k <= pre_len) {
    Out = true;
    putchar(pre[k - 1]);
    return;
  }
  k -= pre_len;
  if (len[dep - 1] < k)
    k -= len[dep - 1];
  else {
    Dfs(dep - 1);
    return;
  }
  if (k <= mid_len) {
    Out = true;
    putchar(mid[k - 1]);
    return;
  }
  k -= mid_len;
  if (len[dep - 1] < k)
    k -= len[dep - 1];
  else {
    Dfs(dep - 1);
    return;
  }
  if (k <= suf_len) {
    Out = true;
    putchar(suf[k - 1]);
    return;
  }
}
int main() {
  Init();
  q = read();
  for (int i = (1), _end_ = (int)(q); i <= _end_; ++i) {
    ln[i] = read();
    scanf("%lld", &lk[i]);
    chkmax(maxn, (int)ln[i]);
    maxk = max(maxk, lk[i]);
  }
  for (int i = (1), _end_ = (int)(maxn); i <= _end_; ++i) {
    len[i] = len[i - 1] * 2 + extra;
    if (len[i] > maxk) len[i] = maxk + 1;
  }
  for (int i = (1), _end_ = (int)(q); i <= _end_; ++i) {
    n = ln[i];
    k = lk[i];
    if (len[n] < k) {
      putchar('.');
      continue;
    }
    Out = false;
    Dfs(n);
  }
  return 0;
}
