#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i,n) for(int i=0;i<n;i++)

const ll mod = ll(1e9) + 7;
const int INF = 1<<29;

int main(){
    int x,n,m;
    cin >> x >> n >> m;
    vector<int> a(n),b(m);
    rep(i,n) cin >> a[i];
    rep(i,m) cin >> b[i];
    P ans = make_pair(0,0);
    rep(i,n){
        if (a[i]==x){
            ans.first = 1;
            break;
        }
    }
    rep(i,m){
        if (b[i]==x){
            ans.second = 1;
            break;
        }
    }
    if (ans.first && ans.second) cout << "MrMaxValu" << endl;
    else if (ans.first) cout << "MrMax" << endl;
    else if (ans.second) cout << "MaxValu" << endl;
    else cout << -1 << endl;
    return 0;
}