Bet#6282
Andrew loves playing Space Poker.
In Space Poker, instead of cards, chips of three colors are used. The casino sets two numbers and — coefficients for calculating bets. Then, using a set of rules, the player places the chips of three colors: red, green, and blue. The winnings are calculated by the formula:
where , , — the number of red, green, and blue chips correspondingly.
The rules for placing bets are very complex, but now Andrew has the following problem. There is already red, green, and blue chips on the table. Before his winnings are calculated, he can add exactly one chip of any color. Help him choose which color chip to place to maximize his winnings.
The input file contains several game situations that need to be analyzed.
The first line contains a single integer (1 \le t \le 10000) — the number of game situations. Each game situation is described by two lines. The first line contains two integers and (1 \le A, C \le 10) — coefficients for determining the winnings. The second line contains three integers , and (0 \le r, g, b \le 15) — the number of red, green, and blue chips correspondingly.
Output lines. In the -th line, output "RED" if it is optimal to add a red chip, "GREEN" if it is optimal to add a green chip, or "BLUE" if it is optimal to add a blue chip. If there are several optimal options, output any of them.
Example 1