6604: Triangle Game
内存限制：128 MB
时间限制：1.000 S
评测方式：文本比较
命题人：
提交：0
解决：0
题目描述
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?
Kate goes first. If both of them play optimally, will Kate win?
输入
The first line of input contains one integer T (1≤T≤104), indicating the number of test cases.
For each test case, the only line contains 3 integers a,b,c (1≤a,b,c≤109). It is guaranteed that there exists a non-degenerate triangle whose side lengths are a,b,c respectively.
For each test case, the only line contains 3 integers a,b,c (1≤a,b,c≤109). It is guaranteed that there exists a non-degenerate triangle whose side lengths are a,b,c respectively.
输出
For each test case, if Kate will win, output Win in a single line. Otherwise, output Lose in a single line.
样例输入 复制
3
2 2 3
2 3 4
5 3 4
样例输出 复制
Win
Lose
Win