Problem 4811. -- Poj2311 Cutting Game

4811: Poj2311 Cutting Game

Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 18  Solved: 12
[Submit][Status][Web Board]


Urej loves to play various types of dull games. He usually asks other people to play with him. He sa
ys that playing those games can show his extraordinary wit. Recently Urej takes a great interest in 
a new game, and Erif Nezorf becomes the victim. To get away from suffering playing such a dull game,
 Erif Nezorf requests your help. The game uses a rectangular paper that consists of W*H grids. Two p
layers cut the paper into two pieces of rectangular sections in turn. In each turn the player can cu
t either horizontally or vertically, keeping every grids unbroken. After N turns the paper will be b
roken into N+1 pieces, and in the later turn the players can choose any piece to cut. If one player 
cuts out a piece of paper with a single grid, he wins the game. If these two people are both quite c
lear, you should write a problem to tell whether the one who cut first can win or not.


The input contains multiple test cases. 
Each test case contains only two integers W and H (2 <= W, H <= 200) in one line, 
which are the width and height of the original paper. 


For each test case, only one line should be printed. 
If the one who cut first can win the game, print "WIN", otherwise, print "LOSE". 

Sample Input

2 2
3 2
4 2

Sample Output