After a long strenuous rawali at IIITB, Raj came back to uniworld. His feet was hurting and it turned out that the lift was not working. He lived on the 4th floor. He climbed up the stairs for sometime. He got tired and sat down. He could see N stairs in front of him. Being an algorithm enthusiast, he wondered what could be the number of ways he could climb up with the option of either taking one step or two steps at a time. He made a quick calculation and gets the result to be M. Verify whether Raj is right.

Input:

T (number of testcases)

N M (number of steps, Raj's calculation of number of ways)

Output:

T lines of "Right/Wrong" for each testcase

Constraints :

1 <= T <= 100

0 <= N <= 45