#include <bits/stdc++.h>
//#include <iostream>
#include <atcoder/all>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = (n-1); i >= 0; i--)
using namespace std;
using namespace atcoder;
typedef long long ll;
const int MOD = 1000000007;
//const int MOD =  998244353;
 
const ll INF = 1LL<<61;
const int IINF = 1000000000;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

typedef pair<int, int> PI;
typedef pair<ll, ll> P;
typedef pair<string, ll> PS;

using mint = modint1000000007;

#include <regex>
int main(){

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll X, N, M; cin >> X >> N >> M;
    vector<ll> A(N); rep(i,N) cin >> A[i];
    vector<ll> B(M); rep(i,M) cin >> B[i];

    int ans = 0;
    rep(i,N){
        if (A[i] == X){
            ans += 1;
            break;
        }
    }
    rep(i,M){
        if(B[i] == X){
            ans += 2;
            break;
        }
    }
    if(ans == 0) cout << -1 << endl;
    else if(ans == 1) cout << "MrMax" << endl;
    else if(ans == 2) cout << "MaxValu" << endl;
    else cout << "MrMaxValu" << endl;
}