Paper Cutting Game

Time Limit: 1000ms
Memory Limit: 32768KB
This problem will be judged on HDU. Original ID: 2869
64-bit integer IO format: %I64d      Java class name: Main

Description

Lily and Lucy are playing a new paper cutting game.
The game uses a rectangular paper that consists of W*H grids.At first,there is only a sheet of W*H paper. In each turn,One player picks up cut one piece of paper and cut it into several pieces of equal rectangular sections,and puts them back. Lily can only cut horizontally and Lucy can only cut vertically,keeping every grids unbroken.The one who can’t cut the paper loses.
Now given you a sheet of W*H paper.We know Lily always plays first.We can assume that both player are clever enough to make the right move.Could you help Lily to make sure if she can win the game?

Input

Input contains multiple cases.
Each test case starts with two integerW(1<=N<=1000) ,H(1<=H<=1000) ,says that there is a sheet of W*H paper at firsst.

Output

For each test case, if Lily can win the game output “Win”,otherwise output “Lose”.

Sample Input

1 1
2 2
4 2
6 4

Sample Output

Lose
Lose
Win
Lose

Source

Language: 
Theme: 
Share Code? 

Powered by NB231 | Current Style: .