#include <bits/stdc++.h>
using namespace std;
template <class X, class Y>
void amax(X& x, const Y& y) {
  if (x < y) x = y;
}
template <class X, class Y>
void amin(X& x, const Y& y) {
  if (x > y) x = y;
}
const int INF = 1e9 + 10;
const long long INFL = 1e18 + 10;
const string f0 =
    "What are you doing at the end of the world? Are you busy? Will you save "
    "us?";
const string p0 = "What are you doing while sending \"";
const string p1 = "\"? Are you busy? Will you send \"";
const string p2 = "\"?";
const int MAX = 1e5 + 10;
long long len[MAX];
char find(int n, long long k) {
  if (k > len[n]) return '.';
  if (n == 0) return f0[k - 1];
  if (k <= (int)p0.size()) return p0[k - 1];
  k -= p0.size();
  if (k <= len[n - 1]) return find(n - 1, k);
  k -= len[n - 1];
  if (k <= (int)p1.size()) return p1[k - 1];
  k -= p1.size();
  if (k <= len[n - 1]) return find(n - 1, k);
  k -= len[n - 1];
  return p2[k - 1];
}
void process() {
  len[0] = f0.size();
  for (int i = 1; i <= MAX - 10; i++) {
    len[i] = len[i - 1] * 2 + p0.size() + p1.size() + p2.size();
    amin(len[i], INFL);
  }
  int q;
  cin >> q;
  while (q--) {
    int n;
    long long k;
    cin >> n >> k;
    cout << find(n, k);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  process();
}
