#include <bits/stdc++.h>
using namespace std;
long long a[100000 + 5];
string s =
    "What are you doing at the end of the world? Are you busy? Will you save "
    "us?";
string first = "What are you doing while sending \"";
string mid = "\"? Are you busy? Will you send \"";
string last = "\"?";
void init() {
  a[0] = 75;
  for (int i = 1; i <= 55; i++) a[i] = 2 * a[i - 1] + 68;
  for (int i = 56; i <= 100000; i++) a[i] = LLONG_MAX;
}
char dfs(long long n, long long k) {
  if (k >= a[n]) return '.';
  if (n == 0) return s[k];
  if (k < first.size()) return first[k];
  k -= first.size();
  if (k < a[n - 1]) return dfs(n - 1, k);
  k -= a[n - 1];
  if (k < mid.size()) return mid[k];
  k -= mid.size();
  if (k < a[n - 1]) return dfs(n - 1, k);
  k -= a[n - 1];
  if (k < last.size()) return last[k];
  return '.';
}
int main() {
  init();
  int q;
  scanf("%d", &q);
  for (int i = 1; i <= q; i++) {
    long long n, k;
    scanf("%lld%lld", &n, &k);
    cout << dfs(n, k - 1);
  }
  cout << endl;
  return 0;
}
