#include "bits/stdc++.h"
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
const long long mod = 1e9 + 7;

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() {
	ll x, n, m;
	cin >> x >> n >> m;

	bool mr = false;
	bool val = false;

	rep(i, n) {
		ll num;
		cin >> num;
		if (x == num) {
			mr = true;
		}
	}

	rep(i, m) {
		ll num;
		cin >> num;
		if (x == num) {
			val = true;
		}
	}

	if (mr && val) {
		cout << "MrMaxValu" << endl;
	} else if (mr && !val) {
		cout << "MrMax" << endl;
	} else if (!mr && val) {
		cout << "MaxValu" << endl;
	} else {
		cout << -1 << endl;
	}

}