Codeforces Round 449 (Div. 1)
A
Nephren gives a riddle
Codeforces
1700
原题
←B →
翻译中…

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

翻译中…

image

翻译中…

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?

翻译中…

Input

翻译中…

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}$).

翻译中…

Output

翻译中…

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

翻译中…

Note

翻译中…

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

翻译中…

样例

Input #1
3
1 1
1 2
1 111111111111
Output #1
Wh.
InputCopy OutputCopy
Input #2
5
0 69
1 194
1 139
0 47
1 66
Output #2
abdef
InputCopy OutputCopy
Input #3
10
4 1825
3 75
3 530
4 1829
4 1651
3 187
4 584
4 255
4 774
2 474
Output #3
Areyoubusy
InputCopy OutputCopy
题目信息
题号
896A
时间限制
2 s
内存限制
256 MB
标签
二分
DFS 及类似

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。