Codeforces 451a game with sticks

Description

After winning gold and silver in IOI 2014, Akshat and malvika want to have some fun. Now they are playing a game on a grid madeNHorizontal andMVertical sticks.

An intersection point is any point on the grid which is formed by the intersection of one horizontal stick and one vertical stick.

In the grid shown below,NBetween = between 3 andMThreads = threads 3. There areNRegion + RegionMKeys = keys 6 sticks in total (horizontal sticks are shown in red and vertical sticks are shown in green). There areN·MPartition = partition 9 intersection points, numbered from 1 to 9.

The rules of the game are very simple. the players move in turns. akshat won gold, so he makes the first move. during his/her move, a player must choose any remaining Intersection Point and remove from the grid all sticks which pass through this point. A player will lose the game if he/she cannot make a move (I. e. there are no intersection points remaining on the grid at his/her move ).

Assume that both players play optimally. Who will win the game?

Input

The first line of input contains two space-separated integers,NAndM(1 digit ≤ DigitN, Bytes,MLimit ≤ limit 100 ).

Output

Print a single line containing "Akshat" or "malvika" (without the quotes), depending on the winner of the game.

Sample test (s) Input

2 2

Output

Malvika

Input

2 3

Output

Malvika

Input

3 3

Output

Akshat

Note

Explanation of the first sample:

The grid has four intersection points, numbered from 1 to 4.

If Akshat chooses Intersection Point 1, then he will remove two sticks (1 hour-second 2 and 1 hour-second 3). The resulting grid will look like this.

Now there is only one remaining Intersection Point (I. e. 4). malvika must choose it and remove both remaining sticks. After her move the grid will be empty.

In the empty grid, Akshat cannot make any move, hence he will lose.

Since all 4 intersection points of the grid are equivalent, Akshat will lose no matter which one he picks.

 

• Question: give you n + M chopsticks and place them horizontally and vertically to Form N * m nodes. Two people choose one point in turn and take the two chopsticks that pass through the point. Whoever forces the other party to take the lead cannot continue the operation will win and ask whether the winner is the first or the latter. • Find the rule. The smaller number in N and M is an odd number. The first hand wins; otherwise, the second hand wins.

 1 #include<stdio.h> 2  3 int main() 4 { 5  6     int n, m, a; 7     while(scanf("%d%d", &n, &m) != EOF){ 8         if(n < m) 9             a = n;10         else11             a = m;12         if(a %2 == 1)13             printf("Akshat\n");14         else15             printf("Malvika\n");16     }17     return 0;18 }