/*** author: yuji9511 ***/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
template <class H,class... T>
void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll X,N,M;
    cin >> X >> N >> M;
    ll A[100010], B[100010];
    rep(i,0,N) cin >> A[i];
    rep(i,0,M) cin >> B[i];
    map<ll,ll> ma,mb;
    rep(i,0,N) ma[A[i]]++;
    rep(i,0,M) mb[B[i]]++;
    if(ma[X] > 0 && mb[X] > 0){
        print("MrMaxValu");
    }else if(ma[X] > 0){
        print("MrMax");
    }else if(mb[X] > 0){
        print("MaxValu");
    }else{
        print("-1");
    }
    

}