Nephren gives a riddle

### 题目描述 奈芙莲有一个字符串数组 $f_{0\dots\infty}$。 $f_0$ 为 `What are you doing at the end of the world? Are you busy? Will you save us?`。 她想让更多人了解这个数组，所以她定义： $$ \forall i\ge 1,f_i=\texttt{What are you doing while sending "}+f_{i-1}\\ +\texttt{"? Are you busy? Will you send "}+f_{i-1}+\texttt{"?} $$ **注意其中的引号。** 奈芙莲会询问 $q$ 次，第 $i$ 次给定 $n,k$，你需要求出 $f_{n,k}$ 的值。**注意字符串从 $1$ 开始。** ### 输入格式 第一行一个正整数 $q$，表示询问的次数。 接下来 $q$ 行，每行两个整数 $n,k$。 ### 输出格式 输出一行 $q$ 个字符。第 $i$ 个字符表示第 $i$ 组询问时 $f_{n,k}$ 的值。如果第 $i$ 组询问时 $\lvert f_n\rvert<k$，则第 $i$ 个字符输出 `.`。 ### 数据范围 对于所有数据，$1\le q\le 10,1\le n\le 10^5,1\le k\le 10^{18}$。

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?

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<=10^{5},1<=k<=10^{18} $ ).

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

3
1 1
1 2
1 111111111111

Wh.

5
0 69
1 194
1 139
0 47
1 66

abdef

10
4 1825
3 75
3 530
4 1829
4 1651
3 187
4 584
4 255
4 774
2 474

Areyoubusy

For the first two examples, refer to $ f_{0} $ and $ f_{1} $ given in the legend.