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. For the first two examples, refer to f 0 and f 1 given in the legend.