#include <bits/stdc++.h>
char s[4][105] = {
    "What are you doing at the end of the world? Are you busy? Will you save "
    "us?",
    "What are you doing while sending \"", "\"? Are you busy? Will you send \"",
    "\"?"};
int len[4];
long long lenn[100005];
int ed;
void dfs(int n, long long k) {
  if (n == 0) {
    printf("%c", s[0][k - 1]);
  } else if (k <= len[1]) {
    printf("%c", s[1][k - 1]);
  } else if (k <= len[1] + lenn[n - 1]) {
    dfs(n - 1, k - len[1]);
  } else if (k <= len[1] + lenn[n - 1] + len[2]) {
    printf("%c", s[2][k - len[1] - lenn[n - 1] - 1]);
  } else if (k <= len[1] + lenn[n - 1] + len[2] + lenn[n - 1]) {
    dfs(n - 1, k - len[1] - lenn[n - 1] - len[2]);
  } else {
    printf("%c", s[3][k - len[1] - lenn[n - 1] - len[2] - lenn[n - 1] - 1]);
  }
}
int main() {
  int q, n;
  long long k;
  for (int i = 0; i < 4; i++) {
    len[i] = strlen(s[i]);
  }
  lenn[0] = len[0];
  for (int i = 1; i <= 100000; i++) {
    lenn[i] = 2 * lenn[i - 1] + len[1] + len[2] + len[3];
    if (lenn[i] >= 1000000000000000000LL) {
      ed = i;
      break;
    }
  }
  for (int i = ed + 1; i <= 100000; i++) {
    lenn[i] = lenn[ed];
  }
  scanf("%d", &q);
  while (q--) {
    scanf("%d%I64d", &n, &k);
    if (lenn[n] < k) {
      printf(".");
    } else {
      dfs(n, k);
    }
  }
  printf("\n");
  return 0;
}
