**Problem Description**

Firstly XiaoXi places the coin in the upper left corner (1,1). Each round everyone can only move the coin horizontally or vertically. All the grids could be visited for at most once. For example, if you moved coin from (1,1) to (3,1) , (1,1), (2,1) and (3,1) can’t be passed again.

Xiaoxi has already known how to win from the beginning of the game.

But his opponent do not know. Now he comes to ask you. Please tell him the result.

**Input**

The first line of the date is an integer T, which is the number of the text cases.

Then T cases follow, each case contains two integers N and M indicate the size of the grid.

T <= 10000

1<= n , m<= 100

**Output**

For each case, output the answer in a line, if first hand will win, output ”Tu Win”, else output ”Tu Lose”.

**Sample Input**

2 1 1 2 2

**Sample Output**

Tu Lose Tu Win

**Source**

2018市赛