#include <iostream>
#include <iomanip>
#include <vector>
#include <utility>
#include <map>
#include <algorithm>
#include <queue>
#include <cmath>
#include <numeric>
#include <set>

using namespace std;
struct aaa{aaa(){cin.tie(nullptr); ios::sync_with_stdio(false); cout<<fixed<<setprecision(20);};}aaa;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v){o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
#define debug(v) {cerr<<"\033[1;36m[debug]\033[m "<<#v<<" : "<<v<<endl;}

using int64 = long long;

int main() {
    int x,n,m;
    cin >> x >> n >> m;
    vector<int> a(n);
    vector<int> b(m);
    for (int i=0; i<n; i++) cin >> a[i];
    for (int i=0; i<m; i++) cin >> b[i];
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());

    auto it1 = lower_bound(a.begin(), a.end(), x);
    auto it2 = lower_bound(b.begin(), b.end(), x);
    if (it1 == a.end()) it1--;
    if (it2 == b.end()) it2--;

    if (*it1 == x && *it2 == x) {
        cout << "MrMaxValu" << endl;
    } else if (*it1 == x) {
        cout << "MrMax" << endl;
    } else if (*it2 == x) {
        cout << "MaxValu" << endl;
    } else {
        cout << -1 << endl;
    }
}