Problem:
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 minimun of 1 from n ( ie.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.
Note : Large Input/Output Data. Use fast I/O.
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.
1<=k<=n.
Problem Setter : Shreyans
Problem Tester : Sandeep
For n=2 and k=1 1st move Rani : n = 2 - 1 = 1 2nd move Nandu : n = 1 - 1 = 0. Now, n has become zero. So, the game is over. Since Nandu palyed the last move, he loses the game. So,
the winner of the game is Rani.
For n=3 and k=2 1st move Rani : n = 3 - 2 = 1 2nd move Nandu : n = 1 - 1 = 0 or n = 1 - 2 = -1. 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.
