codeforce897C

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₀ 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₁ 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₁.

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⁵, 1 ≤ k ≤ 10¹⁸).

Output

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

Example

Input

3
1 1
1 2
1 111111111111

Output

Wh.

Input

5
0 69
1 194
1 139
0 47
1 66

Output

abdef

Input

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

Output

Areyoubusy

Note

For the first two examples, refer to f₀ and f₁ given in the legend.

#include <bits/stdc++.h>
#define LL long long;
using namespace std;
const unsigned long long maxx = 1000000000000000005;
string s0="What are you doing at the end of the world? Are you busy? Will you save us?";
string part1 = "What are you doing while sending \"";
string part2 = "\"? Are you busy? Will you send \"";
string part3 = "\"?";
long long len[100003];
long long Min(long long xx,long long yy)
{
    if(xx<yy)
        return xx;
    return yy;
}
void pre()
{
    len[0] = s0.size();
    for(int i=1;i<=100002;i++)
    {
        len[i] = 2*len[i-1]+part1.size()+part2.size()+part3.size();
        len[i] = Min(len[i],maxx);
    }
}
char solve(int n,long long k)
{
    if(k>=len[n])
        return '.';
    if(n==0)
        return s0[k];
    if(k<part1.size())
        return part1[k];
    k -= part1.size();
    if(k<len[n-1])
        return solve(n-1,k);
    k -= len[n-1];
    if(k<part2.size())
        return part2[k];
    k-=part2.size();
    if(k<len[n-1])
        return solve(n-1,k);
    k-=len[n-1];
    return part3[k];
}
int main()
{
    int p;
    pre();
    while(scanf("%d",&p)!=EOF)
    {
        while(p--)
        {
            int n;
            long long k;
            cin>>n>>k;
            cout<<solve(n,k-1);
        }
        cout<<endl;
    }
    return 0;
}