Board Game
Limits: 2 sec., 256 MiB
Larry and Sergei are playing the following game on a N by M chess board. On each turn a player puts a new 1 by K piece onto the board, where K is any natural number and can be different each turn. The new piece must fit into the board and should not intersect any of the existing pieces. The player that cannot make a move loses. Since both Larry and Sergei are very smart (and rich), they always play in an optimal way. Your job is to find a winner of this game. Larry goes first.
Input
The only line of input contains two integers - N and M.
Output
If Larry wins, print “Larry” (quotes for clarity), otherwise print “Sergei”.
Constraints
\(1 \le \mathbf{N} \le 1000\),
\(1 \le \mathbf{M} \le 1000\).
Samples
Input (stdin) | Output (stdout) |
---|---|
2 2 | Sergei |
Input (stdin) | Output (stdout) |
---|---|
3 1 | Larry |
Notes
In the second sample Larry just puts 1x3 piece and wins.
Submit a solution
Element Type | Created | Who | Problem | Compiler | Result | Time (sec.) | Memory (MiB) | # | Actions |
---|
Element Type | Created | Who | Problem | Compiler | Result | Time (sec.) | Memory (MiB) | # | Actions |
---|