#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
  if (x == 0) return y;
  return (gcd(y % x, x));
}
string Tolower(string s) {
  transform(s.begin(), s.end(), s.begin(), ::tolower);
  return s;
}
string Toupper(string s) {
  transform(s.begin(), s.end(), s.begin(), ::toupper);
  return s;
}
bool prime[100000];
void sieve() {
  memset(prime, true, sizeof(prime));
  prime[0] = prime[1] = false;
  for (long long i = 2; i * i < 100000; i++)
    if (prime[i] == true)
      for (long long j = i * i; j < 100000; j += i) prime[j] = false;
  return;
}
void solve() {
  long long n, m;
  cin >> n >> m;
  if (min(n, m) % 2)
    cout << "Akshat";
  else
    cout << "Malvika";
  return;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}
