#include <bits/stdc++.h>
using namespace std;
template <class T>
void _R(T &x) {
  cin >> x;
}
void _R(int &x) { scanf("%d", &x); }
void _R(int64_t &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U>
void R(T &head, U &...tail) {
  _R(head);
  R(tail...);
}
template <class T>
void _W(const T &x) {
  cout << x;
}
void _W(const int &x) { printf("%d", x); }
void _W(const int64_t &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T, class U>
void _W(const pair<T, U> &x) {
  _W(x.first);
  putchar(' ');
  _W(x.second);
}
template <class T>
void _W(const vector<T> &x) {
  for (auto i = x.begin(); i != x.end(); _W(*i++))
    if (i != x.cbegin()) putchar(' ');
}
void W() {}
template <class T, class... U>
void W(const T &head, const U &...tail) {
  _W(head);
  putchar(sizeof...(tail) ? ' ' : '\n');
  W(tail...);
}
template <class T, class... U>
void DEBUG(const T &head, const U &...tail) {}
int MOD = 1e9 + 7;
void ADD(int64_t &x, int64_t v) {
  x = (x + v) % MOD;
  if (x < 0) x += MOD;
}
const int SIZE = 1e6 + 10;
const int64_t INF = 2e18;
string f0 =
    "What are you doing at the end of the world? Are you busy? Will you save "
    "us?";
string part1 = R"shik(What are you doing while sending ")shik";
string part2 = R"shik("? Are you busy? Will you send ")shik";
string part3 = R"shik("?)shik";
int64_t dp[SIZE];
char solve(int n, int64_t k) {
  if (k > dp[n]) return '.';
  if (n == 0) return f0[k - 1];
  if (k <= ((int)(part1).size())) return part1[k - 1];
  k -= ((int)(part1).size());
  if (k <= dp[n - 1]) return solve(n - 1, k);
  k -= dp[n - 1];
  if (k <= ((int)(part2).size())) return part2[k - 1];
  k -= ((int)(part2).size());
  if (k <= dp[n - 1]) return solve(n - 1, k);
  k -= dp[n - 1];
  if (k <= ((int)(part3).size())) return part3[k - 1];
  return '.';
}
int main() {
  dp[0] = ((int)(f0).size());
  for (int i = (1); i < (SIZE); ++i) {
    dp[i] = dp[i - 1] * 2 + ((int)(part1).size()) + ((int)(part2).size()) +
            ((int)(part3).size());
    if (dp[i] >= INF) dp[i] = INF;
  }
  string an = "";
  int ___T;
  scanf("%d", &___T);
  for (int cs = 1; cs <= ___T; cs++) {
    int n;
    int64_t k;
    R(n, k);
    an += solve(n, k);
  }
  W(an);
  return 0;
}
