Migrated from Lutece 1025 Little Deer and Blue Cat

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

In DOTA, there are two Intellegence heroes. One is Enchantress, who is usually called Little Deer by Chinese players. The other is Storm Spirit, who is usually called Blue Cat by Chinese players.

Well, in UESTC-ACM Team, there are two Intellegent team members. One is acerlawson, who is usually called God Li by others. The other is qzy, who is usually called Master Qiu by others.

One day, qzy and acerlawson are arguing with each other about who is the best DOTA player in the team, so they want to play a game. The game is played in DOTA. However, the rule of the game is quite different from DOTA.

In the game, acerlawson plays Little Deer, and qzy plays Blue Cat. They plays the game in turn, and acerlawson goes first. At frist, Little Deer has $A$ HP, and Blue Cat has $B$ HP. In each hero's turn, the hero can choose an integer $P$ and attack the enemy. The enemy will lose $P$ HP. Here $P$ can be $1$ or any prime number not greater than the enemy's HP. The one whose HP become $0$ first will lose the game.

As they are both intellegent, they will make the best choice to win this game. In another word, they will try to kill the other as early as possible.

Your task is really simple: Given $A$ and $B$, find out who will win this game.

Input

The first line is an integer $T (1 \leq T \leq 1000)$, the number of test cases.

Then $T$ lines follows.

Each line contains two integers $A$ and $B (1 \leq A, B \leq 10^8)$.

Output

For each test case, print God Li if acerlawson will win the game. Otherwise print Master Qiu.

Samples

3
2 4
4 4
99999989 4

Master Qiu
God Li
Master Qiu

Resources

zentorwie