CF896A.Nephren gives a riddle

What are you doing at the end of the world? Are you busy? Will you save us?

Nephren is playing a game with little leprechauns.

She gives them an infinite array of strings, _f_0... ∞.

_f_0 is "What are you doing at the end of the world? Are you busy? Will you save us?".

She wants to let more people know about it, so she defines f__i =  "What are you doing while sending "f__i - 1"? Are you busy? Will you send "f__i - 1"?" for all i ≥ 1.

For example, _f_1 is

"What are you doing while sending "What are you doing at the end of the world? Are you busy? Will you save us?"? Are you busy? Will you send "What are you doing at the end of the world? Are you busy? Will you save us?"?". Note that the quotes in the very beginning and in the very end are for clarity and are not a part of _f_1.

It can be seen that the characters in f__i are letters, question marks, (possibly) quotation marks and spaces.

Nephren will ask the little leprechauns q times. Each time she will let them find the k-th character of f__n. The characters are indexed starting from 1. If f__n consists of less than k characters, output '.' (without quotes).

Can you answer her queries?

在世界末日的尽头，你在做什么？你忙吗？你会拯救我们吗？

奈芙莲正在和一群小精灵玩游戏。

她给了他们一个无限长的字符串数组 $ f_0, f_1, \dots $。

$ f_0 $ 是字符串：
"What are you doing at the end of the world? Are you busy? Will you save us?"。

为了让更多人了解它，她对所有 $ i \geq 1 $ 定义：
$ f_i = $ "What are you doing while sending "$ f_{i-1} $`"? Are you busy? Will you send "`$ f_{i-1} $?"。

例如，$ f_1 $ 是：
"What are you doing while sending "What are you doing at the end of the world? Are you busy? Will you save us?"? Are you busy? Will you send "What are you doing at the end of the world? Are you busy? Will you save us?"?"。
注意：最开头和最末尾的引号仅为清晰起见而添加，并不属于 $ f_1 $ 的一部分。

可以看出，$ f_i $ 中的字符包括字母、问号、（可能的）英文双引号以及空格。

奈芙莲将向小精灵们提出 $ q $ 次询问。每次她都会让他们找出 $ f_n $ 的第 $ k $ 个字符（字符下标从 1 开始）。若 $ f_n $ 的长度小于 $ k $，则输出 .（不带引号）。

你能回答她的这些询问吗？

The first line contains one integer q (1 ≤ q ≤ 10) — the number of Nephren's questions.

Each of the next q lines describes Nephren's question and contains two integers n and k (0 ≤ n ≤ 105, 1 ≤ k ≤ 1018).

第一行包含一个整数 $q$（$1 \le q \le 10$）—— 表示 Nephren 提出的问题数量。

接下来的 $q$ 行，每行描述一个 Nephren 的问题，包含两个整数 $n$ 和 $k$（$0 \le n \le 10^5$，$1 \le k \le 10^{18}$）。

One line containing q characters. The i-th character in it should be the answer for the i-th query.

包含 q 个字符的一行。其中第 i 个字符应为第 i 个查询的答案。

For the first two examples, refer to _f_0 and _f_1 given in the legend.

前两个示例请参考图例中给出的 $f_0$ 和 $f_1$。