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.

<image>

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, n and m (1 ≤ n, m ≤ 100).

Output

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

Examples

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.

<image>

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

<image>

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.
'''
"Do not dwell in the past, do not dream of the future,
concentrate the mind on the present moment."
---BUDDHA

        69696969                         69696969
     6969    696969                   696969    6969
   969    69  6969696               6969  6969     696
  969        696969696             696969696969     696
 969        69696969696           6969696969696      696
 696      9696969696969           969696969696       969
  696     696969696969             969696969        969
   696     696  96969      _=_      9696969  69    696
     9696    969696      q(-_-)p      696969    6969
        96969696         '_) (_`         69696969
           96            /__/  \            69
           69          _(<_   / )_          96
          6969        (__\_\_|_/__)        9696
'''
# Beautiful Python libraries:

from __future__ import division, print_function

#from operator import itemgetter
#import copy
#from time import time
#start=time()
#from fractions import Fraction
import math
#import random,bisect,re
#from collections import Counter,deque,OrderedDict,defaultdict
#from itertools import permutations,ansduct,combinations
#from heapq import heapify,heappush,heappop,heappushpop,heapify,heapreplace,nlargest,nsmallest
#import numpy as np
#from operator import mul


_CUTOFF=300000
MOD=10**9+7
INF=float('+inf')
pie=3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342117067982148086513282306647093844609550582231725359408128481117450284102701938521105559644622948954930381964428810975665933446128475648233786783165271201909145648566923460348610454326648213393607260249141273724587006 

"------------------------------------------------------------------------"
#FAST I/O for PYPY:
#Thanks to pajenegod

py2 = round(0.5)
if py2:
    from future_builtins import ascii, filter, hex, map, oct, zip
    range = xrange
 
import os, sys
from io import IOBase, BytesIO
 
BUFSIZE = 8192
class FastIO(BytesIO):
    newlines = 0
 
    def __init__(self, file):
        self._file = file
        self._fd = file.fileno()
        self.writable = "x" in file.mode or "w" in file.mode
        self.write = super(FastIO, self).write if self.writable else None
 
    def _fill(self):
        s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
        self.seek((self.tell(), self.seek(0,2), super(FastIO, self).write(s))[0])
        return s
 
    def read(self):
        while self._fill(): pass
        return super(FastIO,self).read()
 
    def readline(self):
        while self.newlines == 0:
            s = self._fill(); self.newlines = s.count(b"\n") + (not s)
        self.newlines -= 1
        return super(FastIO, self).readline()
 
    def flush(self):
        if self.writable:
            os.write(self._fd, self.getvalue())
            self.truncate(0), self.seek(0)
 
class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        if py2:
            self.write = self.buffer.write
            self.read = self.buffer.read
            self.readline = self.buffer.readline
        else:
            self.write = lambda s:self.buffer.write(s.encode('ascii'))
            self.read = lambda:self.buffer.read().decode('ascii')
            self.readline = lambda:self.buffer.readline().decode('ascii')
 
 
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
raw_input = lambda: sys.stdin.readline().rstrip('\r\n')

"--------------------------------------------------------------------------"

def si():
    return str(stdin.readline())
def ii():
    return int(raw_input())
def mi():
    return map(int,raw_input().split())
def li():
    return [int(i) for i in raw_input().split()]
def debug(x):
	return sys.stdout.write(str(x))
def limul(list):
	return eval('*'.join(str(item) for item in list))

"--------------------------------------------------------------------------"
def main():
    n,m=mi()
    if (min(n,m)%2==1):
        print ('Akshat')
    else:
        print ('Malvika')
    




























main()

