#include <bits/stdc++.h>
using namespace std;
string f0 =
    "What are you doing at the end of the world? Are you busy? Will you save "
    "us?";
string s = "What are you doing while sending \"";
string f = "\"? Are you busy? Will you send \"";
string r = "\"?";
char A;
long long dp[100005];
bool F;
void solve(int n, long long k) {
  if (F) return;
  if (n == 0) {
    if (k >= 0 && k < f0.size()) {
      cout << f0[k];
      F = 1;
    }
    return;
  }
  if (F) return;
  if (k >= 0 && k < s.size()) {
    cout << s[k];
    F = 1;
    return;
  }
  k -= s.size();
  if (k < dp[n - 1])
    solve(n - 1, k);
  else
    k -= dp[n - 1];
  if (F) return;
  if (k >= 0 && k < f.size()) {
    cout << f[k];
    F = 1;
    return;
  }
  k -= f.size();
  if (k < dp[n - 1])
    solve(n - 1, k);
  else
    k -= dp[n - 1];
  if (F) return;
  if (k >= 0 && k < r.size()) {
    cout << r[k];
    F = 1;
    return;
  }
}
int main() {
  int n, q;
  long long k;
  cin >> q;
  for (int i = 0; i < 100005; i++) dp[i] = 1000000000000000001;
  dp[0] = f0.size();
  for (int i = 1; i < 100005; i++) {
    dp[i] = s.size() + dp[i - 1] + f.size() + dp[i - 1] + r.size();
    if (dp[i] >= 1000000000000000001) {
      dp[i] = 1000000000000000001;
      break;
    }
  }
  for (int j = 0; j < q; j++) {
    cin >> n >> k;
    k--;
    F = 0;
    if (k + 1 > dp[n])
      cout << '.';
    else
      solve(n, k);
  }
}
