#include <bits/stdc++.h>
using namespace std;
string a =
    "What are you doing at the end of the world? Are you busy? Will you save "
    "us?";
string pref = "What are you doing while sending \"";
string suff = "\"? Are you busy? Will you send \"";
string last = "\"?";
long long f[100001];
long long q, n, k, n1, n2, n3, n4;
const long long inf = 1e18 + 10;
char solution(long long n, long long k) {
  if (k > f[n]) return '.';
  if (n == 0) return a[k - 1];
  if (k <= n2) return pref[k - 1];
  k = k - n2;
  if (k <= f[n - 1]) return solution(n - 1, k);
  k = k - f[n - 1];
  if (k <= n3) return suff[k - 1];
  k = k - n3;
  if (k <= f[n - 1]) return solution(n - 1, k);
  k = k - f[n - 1];
  if (k <= n4) return last[k - 1];
}
int main() {
  n1 = a.length();
  n2 = pref.length();
  n3 = suff.length();
  n4 = last.length();
  f[0] = n1;
  for (int i = 1; i <= 100000; i++)
    f[i] = min(inf, n2 + f[i - 1] + n3 + f[i - 1] + n4);
  cin >> q;
  while (q > 0) {
    cin >> n >> k;
    q = q - 1;
    cout << solution(n, k);
  }
  return 0;
}
