#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
vector<long long> fsz(56, 0);
string o =
    "What are you doing at the end of the world? Are you busy? Will you save "
    "us?";
string l = "What are you doing while sending \"";
string m = "\"? Are you busy? Will you send \"";
string r = "\"?";
char solve(long long n, long long k) {
  if (n == 0) {
    if (k < o.size()) {
      return o[k];
    } else {
      return '.';
    }
  }
  if (k < l.size()) {
    return l[k];
  }
  if (n <= 56) {
    if (k < l.size() + fsz[n - 1]) {
      return solve(n - 1, k - l.size());
    }
    if (k >= l.size() + fsz[n - 1] && k < l.size() + fsz[n - 1] + m.size()) {
      return m[k - l.size() - fsz[n - 1]];
    }
    if (k >= l.size() + fsz[n - 1] + m.size() &&
        k < l.size() + fsz[n - 1] + m.size() + fsz[n - 1]) {
      return solve(n - 1, k - l.size() - fsz[n - 1] - m.size());
    }
    if (k >= l.size() + fsz[n - 1] + m.size() + fsz[n - 1] &&
        k < l.size() + fsz[n - 1] + m.size() + fsz[n - 1] + r.size()) {
      return r[k - l.size() - fsz[n - 1] - m.size() - fsz[n - 1]];
    }
    return '.';
  } else {
    return solve(n - 1, k - l.size());
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  fsz[0] = o.size();
  for (int i = 1; i < 56; ++i) {
    fsz[i] = fsz[i - 1] * 2 + 68;
  }
  int q = 0;
  cin >> q;
  while (q-- > 0) {
    long long n, k;
    cin >> n >> k;
    cout << solve(n, k - 1);
  }
  return 0;
}
