Given 3 baskets filled with known amount of fruits in each, turn-by-turn, both the competitors have to eat at least one fruits to at most all the fruits from any one basket. The one, who eats the last fruit of all, is the winner and the other person has to pay the entire bill of the party. All the competitors, including You, will play optimally. Now as You are the birthday girl/Boy,you always takes the first turn. Tell us whether you wins or looses.

Input Format:

The first line contains a single positive integer, T. T test cases follow. Each of the next T lines contain 3 space-separated integers “a b c” denoting the number of fruits in each basket.

Output Format:

A single line for each test case telling if YOU has to pay the bill or not. If you loses the game then print “YOU LOOSE” otherwise print “YOU WIN”.

Constraints:

1<= T <= 100

1 <= a, b, c <= 10^6