// https://arc073.contest.atcoder.jp/tasks/arc073_b
#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

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 argc, char** argv) {
    int x, n, m;
    cin >> x >> n >> m;
    vector<int> a(n), b(n);

    rep(i, n) { cin >> a[i]; }
    rep(i, m) { cin >> b[i]; }

    bool ina = find(a.begin(), a.end(), x) != a.end();
    bool inb = find(b.begin(), b.end(), x) != b.end();

    if (ina && inb)
        cout << "MrMaxValu" << endl;
    else if (ina)
        cout << "MrMax" << endl;
    else if (inb)
        cout << "MaxValu" << endl;
    else
        cout << -1 << endl;

    return 0;
};