#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const int N = 1e5 + 100;
long long len[N];
long long len1, len2, len3, len4;
const string s1 =
    "What are you doing at the end of the world? Are you busy? Will you save "
    "us?";
const string s2 = "What are you doing while sending \"";
const string s3 = "\"? Are you busy? Will you send \"";
const string s4 = "\"?";
void dfs(long long n, long long k) {
  if (n == 0)
    printf("%c", s1[k - 1]);
  else if (k <= len2)
    printf("%c", s2[k - 1]);
  else if (k <= len2 + len[n - 1]) {
    k -= len2;
    dfs(n - 1, k);
  } else if (k <= len2 + len[n - 1] + len3)
    printf("%c", s3[k - 1 - (len2 + len[n - 1])]);
  else if (k <= len2 + len[n - 1] + len3 + len[n - 1]) {
    k = k - len2 - len[n - 1] - len3;
    dfs(n - 1, k);
  } else {
    k = k - len2 - len[n - 1] * 2 - len3;
    printf("%c", s4[k - 1]);
  }
}
int main() {
  len1 = s1.length();
  len2 = s2.length();
  len3 = s3.length();
  len4 = s4.length();
  len[0] = len1;
  for (int i = 1; i < N - 1; i++) {
    len[i] = min(len2 + len[i - 1] + len3 + len[i - 1] + len4, inf);
  }
  long long q, n, k;
  scanf("%lld", &q);
  for (int i = 1; i <= q; i++) {
    scanf("%lld%lld", &n, &k);
    if (!n && k <= len[0])
      printf("%c", s1[k - 1]);
    else if (k <= len[n])
      dfs(n, k);
    else
      printf(".");
  }
  printf("\n");
}
