402918: GYM100947 F black-white

Steven met his old friend Mikael yesterday and he told him about a very interesting game. The game board is made of N cells aligned in a row , and two colored stones in two different fixed positions of this row. The first stone is white, and the second is black. Steven plays with the white stone, and Mikael plays with the black one.

The two players play alternately, Each player in his turn can move his stone one cell to the right or to the left, but he cannot move it outside the board or onto a cell occupied by the other player. Steven goes first. The player who cannot make any move loses.

Steven and Mikael have become very good at playing this game, so they can know the winner of the game just by looking at the starting state of the board. Can you do the same?

You are given the initial game board and you should know who is the winner of this match, considering both players playing optimally (if both players play optimally the game will end).

The first line of input is an integer T which represents the number of test cases. Each of the next T lines consists three integers N , W , B , the length of the game board , the position of the white stone , the position of the black stone (2  ≤  N  ≤  100000) (1  ≤  B , W  ≤  N)

For each test case, output a single line representing its answer; if Steven is the winner output "Steven" (without quotes) otherwise "Mikael" (without quotes).

1
11 4 8

Steven