x,y=map(int,input().split())
if(x<y):
if(x%2==0):
print("Malvika")
else:
print("Akshat")
else:
if(y%2==0):
print("Malvika")
else:
print("Akshat")
#include <iostream>
using namespace std;
int main() {
int n,m;
cin>>n>>m;
bool ma=0;
if(min(n,m)&1){
ma=1;
}
if(ma)
{
cout<<"Akshat";
}
else{
cout<<"Malvika";
}
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int x,y;
cin >> x >> y;
if (x < y) {
if (x % 2 == 0) {
cout << "Malvika";
}
else
cout << "Akshat";
}
else {
if (y % 2 == 0) {
cout << "Malvika";
}
else
cout << "Akshat";
}
}
1313. Decompress Run-Length Encoded List | 1281. Subtract the Product and Sum of Digits of an Integer |
1342. Number of Steps to Reduce a Number to Zero | 1528. Shuffle String |
1365. How Many Numbers Are Smaller Than the Current Number | 771. Jewels and Stones |
1512. Number of Good Pairs | 672. Richest Customer Wealth |
1470. Shuffle the Array | 1431. Kids With the Greatest Number of Candies |
1480. Running Sum of 1d Array | 682. Baseball Game |
496. Next Greater Element I | 232. Implement Queue using Stacks |
844. Backspace String Compare | 20. Valid Parentheses |
746. Min Cost Climbing Stairs | 392. Is Subsequence |
70. Climbing Stairs | 53. Maximum Subarray |
1527A. And Then There Were K | 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers |
318. Maximum Product of Word Lengths | 448. Find All Numbers Disappeared in an Array |
1155. Number of Dice Rolls With Target Sum | 415. Add Strings |
22. Generate Parentheses | 13. Roman to Integer |
2. Add Two Numbers | 515. Find Largest Value in Each Tree Row |