There are two piles of lemons; one pile initially contains $N$ lemons, while the other pile initially contains $M$ lemons. A game is played with these piles between two players, in which the players alternate making moves. In each move, a player performs the following:

• Remove a positive number of lemons from a pile, or
• Remove the same positive number of lemons from both piles.

The player who is unable to make a move is the loser. If both players play optimally, determine whether the first player will win.

Constraints

$1\le N,M\le {10}^9$

Input Specification

The only line contains two space-separated integers, $N$ and $M$.

Output Specification

Output Win if the first player wins, and Lose otherwise.

Sample Input

4 5

Sample Output

Win