问题 D: Chocolate

链接：https://ac.nowcoder.com/acm/contest/57355/D
来源：牛客网
Walk Alone has n×m pieces of chocolates placed in a board with n rows and $m$ columns. The coordinates of the i-th row and the $j$-th column is (i,j).
Walk Alone wants to play a game with Kelin. They will eat the chocolates in turn with Kelin moving first. In each turn, a player can choose two integers i,j (1≤i≤n,1≤j≤m), and then eat all chocolates with coordinates (x,y) where x≤i and y≤j. One must eat at least one piece of chocolate in his turn, and the one who eats the last piece loses the game.
Suppose that both Walk Alone and Kelin are intelligent enough and will play optimally, you should decide who will win the game. If Walk Alone will win, print 'Walk Alone'; otherwise, print 'Kelin' (without quotes).

The only line of the input contains two integers n and m (1≤n,m≤10^9), indicating the size of the board.

Print 'Walk Alone' if he wins, and 'Kelin' otherwise (without quotes).

2 3

Kelin