#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:512000000")
using namespace std;
void solve(bool);
void precalc();
clock_t start;
int main() {
  start = clock();
  int t = 1;
  cout.sync_with_stdio(0);
  cin.tie(0);
  precalc();
  cout.precision(10);
  cout << fixed;
  int testNum = 1;
  while (t--) {
    solve(true);
  }
  cout.flush();
  return 0;
}
template <typename T>
T binpow(T q, T w, T mod) {
  if (!w) return 1 % mod;
  if (w & 1) return q * 1LL * binpow(q, w - 1, mod) % mod;
  return binpow(q * 1LL * q % mod, w / 2, mod);
}
template <typename T>
T gcd(T q, T w) {
  while (w) {
    q %= w;
    swap(q, w);
  }
  return q;
}
template <typename T>
T lcm(T q, T w) {
  return q / gcd(q, w) * w;
}
template <typename T>
void make_unique(vector<T>& a) {
  sort(a.begin(), a.end());
  a.erase(unique(a.begin(), a.end()), a.end());
}
template <typename T>
void relax_min(T& cur, T val) {
  cur = min(cur, val);
}
template <typename T>
void relax_max(T& cur, T val) {
  cur = max(cur, val);
}
void precalc() {}
void solve(bool read) {
  string first =
      "What are you doing at the end of the world? Are you busy? Will you save "
      "us?";
  string cur =
      "What are you doing while sending \"S\"? Are you busy? Will you send "
      "\"S\"?";
  const long long INF = (long long)2e18;
  vector<long long> len(2 * 100000);
  len[0] = (long long)first.length();
  for (long long i = 1; i < len.size(); ++i) {
    len[i] = (long long)cur.length() - 2 + 2 * len[i - 1];
    len[i] = min(len[i], INF);
  }
  long long T;
  cin >> T;
  while (T--) {
    long long n, k;
    cin >> n >> k;
    while (true) {
      if (k > len[n]) {
        cout << ".";
        break;
      }
      if (n == 0) {
        cout << first[k - 1];
        break;
      }
      if (k <= 34) {
        cout << cur[k - 1];
        break;
      }
      if (k <= 34 + len[n - 1]) {
        k -= 34;
        --n;
        continue;
      }
      if (k <= 34 + len[n - 1] + 32) {
        cout << cur[k - len[n - 1]];
        break;
      }
      if (k == len[n]) {
        cout << "?";
        break;
      }
      if (k == len[n] - 1) {
        cout << "\"";
        break;
      }
      k -= 34 + 32 + len[n - 1];
      --n;
    }
  }
  cout << endl;
}
