Dr. JYY has just created the Coffee Chicken strings, denoted as S(n). They are quite similar to the Fibonacci soup --- today's soup is made by mingling yesterday's soup and the day before yesterday's soup:
- ;
- ;
- S(n) = S(n-2) :: S(n-1), where :: denotes string concatenation.
The length of S(n) quickly gets out of control as n increases, and there would be no enough memory in JYY's game console to store the entire string. He wants you to find 10 contiguous characters in S(n), starting from the kth character.

The first line of input is a single integer T , denoting the number of test cases. Each of the following T lines is a test case, which contains two integers n, k . |S| denotes the length of string S.

For each test case, print the answer in one line. If there are no enough characters from the kth character, output all characters until the end of the string.

2
3 4
2 7

FEECHICKEN
N