#include <bits/stdc++.h>
using namespace std;
const int MODULO = 1000000007;
void SolveA() {
  string l0 =
      "What are you doing at the end of the world? Are you busy? Will you save "
      "us?";
  string p[3];
  p[0] = "What are you doing while sending \"";
  p[1] = "\"? Are you busy? Will you send \"";
  p[2] = "\"?";
  unsigned long long BIGL = 4000000000000000000ULL;
  vector<unsigned long long> L(100001);
  L[0] = l0.length();
  for (size_t i = 1; i <= 100000; ++i) {
    L[i] = 2 * L[i - 1] + p[0].length() + p[1].length() + p[2].length();
    if (L[i] > BIGL) L[i] = BIGL;
  }
  size_t q;
  cin >> q;
  for (size_t iTest = 0; iTest < q; ++iTest) {
    unsigned long long n, k;
    cin >> n >> k;
    --k;
    if (k >= L[n]) {
      cout << ".";
      continue;
    }
    while (true) {
      if (n == 0) {
        cout << l0[k];
        break;
      }
      if (k < p[0].length()) {
        cout << p[0][k];
        break;
      }
      k -= p[0].length();
      if (k < L[n - 1]) {
        --n;
        continue;
      }
      k -= L[n - 1];
      if (k < p[1].length()) {
        cout << p[1][k];
        break;
      }
      k -= p[1].length();
      if (k < L[n - 1]) {
        --n;
        continue;
      }
      k -= L[n - 1];
      if (k < p[2].length())
        cout << p[2][k];
      else
        cout << ".";
      break;
    }
  }
  cout.flush();
}
int main(int argc, char **argv) {
  SolveA();
  return 0;
}
