#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define inputv(v, n)                                                           \
    vl v;                                                                      \
    rep(i, n) {                                                                \
        ll x;                                                                  \
        cin >> x;                                                              \
        v.push_back(x);                                                        \
    }
bool chmin(ll& a, ll& b) { if (b < a) { a = b; return 1; } return 0; }
bool chmax(ll& a, ll& b) { if (b > a) { a = b; return 1; } return 0; }
const ll INF = 999999999999999;
const ll MOD = 1000000007;
const ll MAX_N = 500010;
ll a, b, c, d, e, f, p, t, x, y, z, q, m, n, r, h, k, w, l, ans;
int main() {
    cin >> x >> n >> m;
    set<ll> A, B;
    rep(i, n) {
        cin >> a;
        A.insert(a);
    }

    rep(i, m) {
        cin >> a;
        B.insert(a);
    }

    if (A.count(x) == 1 && B.count(x) == 1) {
        cout << "MrMaxValu"<<endl;
    }
    if (A.count(x) == 1 && B.count(x) == 0) {
        cout << "MrMax"<<endl;
    }
    if (A.count(x) == 0 && B.count(x) == 1) {
        cout << "MaxValu" << endl;
    }
    if (A.count(x) == 0 && B.count(x) == 0) {
        cout << -1 << endl;
    }

}