The Roman empire has n cities. Each city has a number of buildings. The Gods periodically pick a city and cause a fire that burns a number of buildings in that city. Nero, the ruthless ruler of the empire, gets very upset at that, but since he is powerless against the Gods, he decides to do the same - after each fire caused by the Gods, he, too, picks a city (possibly the same one) and burns a number of buildings there. Then the Gods cause another fire, etc. until there are no buildings left in any of the cities.

To keep within the bounds of reason, Nero and the Gods have an agreement. They will each burn between 1 and k buildings at a time. All that Nero can do is try and make sure that eventually, there will be no buildings left for the Gods to burn, so he takes out his abacus (it's no laptop, but at least it's Turing-complete) and wants to decide whether the Gods can prevent him from burning the last building.

Input
The input will begin with a line containing C - the number of test cases. Each test case will begin with a line containing two numbers - k and n (1<=k,n<=100). The next n lines will contain the number of buildings in each of the n cities. No city will have more than 100 buildings.

Output
For each test case, output the line "Nero" if no matter what the Gods do, Nero will always be able to burn the last building. Otherwise, output the line "Gods".

4
15 1
15
4 2
1
2
1 2
1
3
100 5
1 2 3 4 4

Gods
Gods
Nero
Nero