该比赛已结束，您无法在比赛模式下递交该题目。您可以点击“在题库中打开”以普通模式查看和递交本题。

Description

Alice and Bob are playing a duel game, where the outcome is determined solely by their combat power. Let’s see the following scenarios:

• Day 1: Alice has a combat power of 6, Bob has 5. Since Alice’s combat power is higher than Bob’s, Alice wins and will say "Win".

• Day 2: Alice has 6, Bob has 500. Alice’s combat power is lower, but she has a friend Candy with a combat power of 1000. Alice argues that since Bob didn’t beat Candy, Bob loses — so Alice wins and will say "WIN".

• Day 3: Alice has 6, Bob has 5000, and Candy has 1000. Neither Alice nor Candy has a higher combat power than Bob. Alice can’t win in any way, so she will say "nowin".

Given three integers $a$, $b$, and $c$ representing the combat powers of Alice, Bob, and Candy respectively, determine the output based on these rules:

• If $a > b$ (Day 1’s scenario), output "Win".

• Otherwise, if $c > b$ (Day 2’s scenario), output "WIN".

• In all other cases, output "nowin".

Input Format

The first line contains an integer $T$ — the number of test cases.

Each test case consists of a single line with three integers $a$, $b$, $c$ .

$1 \leq T \leq 100,0 \leq a, b, c \leq 10^9$

Output Format

For each test case, output a single line containing the answer. Note that the answer is case-sensitive (i.e., "Win", "WIN", and "nowin" are distinct).

Sample Input

5
6 5 1000
6 500 1000
6 5000 1000
1234 4009 4039
6 6 6

Sample Output

Win
WIN
nowin
WIN
nowin