#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
bool Max(T1& a, T2 b) {
  return a < b ? a = b, 1 : 0;
}
template <typename T1, typename T2>
bool Min(T1& a, T2 b) {
  return a > b ? a = b, 1 : 0;
}
const int N = 100001, inf = 1e9 + 1;
string f0 =
    "What are you doing at the end of the world? Are you busy? Will you save "
    "us?";
string f1 = "What are you doing while sending \"";
string f2 = "\"? Are you busy? Will you send \"";
string f3 = "\"?";
long long f[N];
char get(long long n, long long k) {
  if (k >= f[n]) return '.';
  if (n == 0) return f0[k];
  if (k < f1.size()) return f1[k];
  k -= f1.size();
  if (k < f[n - 1]) return get(n - 1, k);
  k -= f[n - 1];
  if (k < f2.size()) return f2[k];
  k -= f2.size();
  if (k < f[n - 1]) return get(n - 1, k);
  k -= f[n - 1];
  return f3[k];
}
void solve() {
  f[0] = f0.size();
  for (int i = 1; i <= (N - 1); ++i) {
    f[i] = f1.size() + f2.size() + f3.size() + f[i - 1] * 2;
    if (f[i] > 1e18) f[i] = 1e18;
  }
  long long q, n, k;
  cin >> q;
  while (q--) {
    cin >> n >> k;
    cout << get(n, k - 1);
  }
  cout << '\n';
}
void init() {}
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.setf(ios::fixed);
  cout.precision(20);
  init();
  int TC = 1;
  for (int TI = 1; TI <= (TC); ++TI) {
    solve();
  }
  return 0;
}
