Mona and her brother Alaa are very smart kids, they love math a lot and they are passionate to invent new games.
So after they went back from school they invented a new game called "N..K..Divide".
First of all, let's define a function D(m), such that D(m) is the number of distinct primes in the prime factorization of m.
For Example D(9) = 1 and D(12) = 2.
The rules of the game are simple:
- The game consists of rounds.
- In each round there are two integer numbers N and K.
- Each round consists of multiple turns.
- Each player alternately takes turn (starting with the player who won the last round / by Mona in the first round).
- In each turn the player choose some positive integer M, where 2 ≤ M ≤ N such that N is divisible by M and D(m) ≤ K, then divides N by the chosen M.
- The first player who cannot make any valid move loses.
- The player who wins more rounds is declared as the winner of the game (if tie then Mona is considered the winner).
So the kids asked their father to run the game for them.
For each of the R rounds father gives them two integer numbers N, K and wants to know who will be the winner of this round if they both play optimally (to win the current round).
The first line consists of a single integer 1 ≤ R ≤ 10 the number of rounds the kids are going to play.
Each of the next R lines contains two space-separated integers N, K where 2 ≤ N ≤ 1014, 1 ≤ K ≤ 10.
Print R+2 lines.
For the first R lines, the ith line of them should contain the name of the winner of ith round if both players play optimally "Mona" or "Alaa" (without quotation marks).
The line number R+1 is an empty line.
In the last print the name of the winner, print "Mona" if Mona is the winner of the game otherwise print "Alaa" (without quotation marks).
5 3 4 6 2 6 1 9 1 18 2
Mona Mona Alaa Alaa Alaa Alaa
Time and memory limit:
- 1 second
Problem source: SPOJ