Rani and Nandu decide to play a number game. Both play alternately, Rani playing the first move.
In each of their moves, they can subtract a maximum of k and a minimum of 1 from n i.e. each of them must subtract from n, any natural number less than or equal to k , and the new value of n will be the result of this subtraction.
They continue playing this game until the value of n becomes zero or negative. The person to play the last move loses the game.
Both are super-intelligent and hence both play optimally. Given the values of n and k, find out the winner of the game.
Input:
First line consists of t, the number of test case. The next t lines are such that each line consists of two space separated integers n and k.
Output:
Print the answer to each test case on a new line, 'Rani' if the winner of the game is Rani and 'Nandu' if the winner of the game is Nandu.
Constraints:
1<=t<=1000000
1<=n<=1000000.
For n=1 and k=2 1st move Rani : n = 1 - 1 = 0. Since, no more turn is possible and Rani palyed the last move, she loses the game. So,the winner of the game is Nandu.
For n=4 and k=1 1st move Rani : n = 4 - 1 = 3, 2nd move Nandu : n = 3 - 1 = 2, third move Rani n = 2 - 1 = 1 and last move Nandu n=1-1=0 Now, n has become zero/negative. So, the game is over. Since Nandu palyed the last move, he loses the game. So, the winner of the game is Rani.
