Problem Description

Kate and Emilico are playing a game. There are $3$ integers $a,b,c$. It is guaranteed that there exists a non-degenerate triangle whose side lengths are $a,b,c$ respectively. The game goes as follows. Players take turns in decreasing a certain positive integer on one of the $3$ integers. If there doesn't exist a non-degenerate triangle whose side lengths are $a,b,c$ after a player's operation, the player loses.

Kate goes first. If both of them play optimally, will Kate win?

Input

The first line of input contains one integer $T$ ($1\le T\le 10^4$), indicating the number of test cases.

For each test case, the only line contains $3$ integers $a,b,c$ ($1\le a,b,c\le 10^9$). It is guaranteed that there exists a non-degenerate triangle whose side lengths are $a,b,c$ respectively.

Output

For each test case, if Kate will win, output $\texttt{Win}$ in a single line. Otherwise, output $\texttt{Lose}$ in a single line.

3
2 2 3
2 3 4
5 3 4

Win
Lose
Win