Game

Mirek likes playing with numbers. He plays the following game with his friend Kamil.

A game starts with two non-negative integers $A$ and $B$. Assume $A \le B$. The players take turns, and on a turn a player makes one of these two moves.

• Replace $B$ with $B-AK$. The player can pick any integer $K$ with $K>0$ and $B-AK \ge 0$.
• Replace $B$ with $B \bmod A$.

If $B \le A$, the same moves are available with the roles of the two numbers swapped. The player who turns either number into $0$ wins. Mirek always moves first.

Both players play optimally. For each game, determine whether Mirek or Kamil wins.

The first line contains the number of games $T$ ($1 \le T \le 10^4$). Each of the next $T$ lines describes one game and contains two integers $A$ and $B$ ($1 \le A, B \le 10^{18}$).

Print $T$ lines. Line $i$ contains the name of the winner of the $i$-th game, either Mirek or Kamil.