#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define rep(i,n) for(int i=0;i<(n);i++) #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sz(x) ((int)(x).size()) #define pb push_back #define mod 1000000007 using ll = long long; using namespace std; ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;} ll lcm(ll a, ll b) {return a/gcd(a,b)*b;} int main(){ int X, N, M; cin >> X >> N >> M; bool mr = false; bool mx = false; int num; rep(i,N){ cin >> num; if(num == X) mr = true; } rep(i,M){ cin >> num; if(num == X) mx = true; } if(mr & mx) cout << "MrMaxValu" << endl; else if(mr) cout << "MrMax" << endl; else if(mx) cout << "MaxValu" << endl; else cout << -1 << endl; return 0; }