CF451A.Game With Sticks

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 made of n horizontal and m vertical 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, n = 3 and m = 3. There are n + m = 6 sticks in total (horizontal sticks are shown in red and vertical sticks are shown in green). There are n·m = 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?

在 IOI 2014 中分别斩获金牌和银牌后，Akshat 和 Malvika 想找点乐子。现在他们正在一个由 $n$ 根水平木棍和 $m$ 根垂直木棍构成的网格上进行一场游戏。

交点是指网格中任意一个由一根水平木棍与一根垂直木棍相交所形成的点。

在下方所示的网格中，$n = 3$ 且 $m = 3$。网格中共有 $n + m = 6$ 根木棍（水平木棍以红色表示，垂直木棍以绿色表示）。共有 $n \cdot m = 9$ 个交点，编号为 $1$ 至 $9$。

游戏规则非常简单：双方轮流行动。由于 Akshat 获得了金牌，他先行。在每一轮中，当前玩家必须选择一个尚存的交点，并从网格中移除所有经过该交点的木棍（即该交点所在的那根水平木棍和那根垂直木棍）。若轮到某位玩家行动时，网格上已无任何交点剩余，则该玩家输掉游戏。

假设双方均采取最优策略，谁将赢得这场游戏？

The first line of input contains two space-separated integers, n and m (1 ≤ n, m ≤ 100).

输入的第一行包含两个用空格分隔的整数 $n$ 和 $m$（$1 \leq n, m \leq 100$）。

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

输出一行，包含 "Akshat" 或 "Malvika"（不带引号），具体取决于游戏的获胜者。

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 - 2 and 1 - 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.

第一个样例的解释：

该网格共有四个交点，编号为 1 至 4。

若 Akshat 选择交点 1，则他将移除两条线段（1 - 2 和 1 - 3）。此时网格变为如下所示：

此时仅剩一个交点（即交点 4）。Malvika 必须选择该交点，并移除剩余的两条线段。她操作后，网格将变为空。

在空网格中，Akshat 无法进行任何操作，因此他将输掉游戏。

由于该网格的全部 4 个交点均等价，无论 Akshat 选择哪一个，他都将输掉游戏。