Election

The fundraising, the campaigning and the debates are over, and election day has arrived. Two candidates are left on the ballot, and you work as an aide to one of them.

Reports from the polling stations are starting to come in, and you hope to declare a victory soon.

There are $N$ voters, and every one of them votes for one of the two candidates. There are no spoiled ballots. To win, a candidate needs more than half of all $N$ votes. So far $M \le N$ ballots have been counted, and candidate $i$ holds $V_i$ of them, where $V_1 + V_2 = M$. $V_1$ is the count for your candidate.

From past data and careful polling you know that each uncounted ballot goes to your candidate with probability 50%, independently of the others. That is why you think the win can be announced before the count finishes. If the probability of winning is strictly greater than the threshold $W$, the victory is yours. Just be sure about it, nobody wants a scandal.

The first line contains one integer $T$ ($1 \le T \le 100$), the number of test cases. Each of the next $T$ lines contains four integers $N$, $V_1$, $V_2$ and $W$.

• $1 \le N \le 50$
• $50 \le W < 100$
• $V_1, V_2 \ge 0$
• $V_1 + V_2 \le N$

For each test case print the matching action on its own line.

• If the probability that your candidate wins is strictly greater than $W$%, print GET A CRATE OF CHAMPAGNE FROM THE BASEMENT!
• If your candidate has no chance of winning, print RECOUNT!
• Otherwise print PATIENCE, EVERYONE!