#include using namespace std; typedef long long ll; #define F first #define S second #define pii pair #define eb emplace_back #define all(v) v.begin(), v.end() #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep3(i, l, n) for (int i = l; i < (n); ++i) #define sz(v) (int)v.size() const int inf = 1e9 + 7; const ll INF = 1e18; #define abs(x) (x >= 0 ? x : -(x)) #define lb(v, x) (int)(lower_bound(all(v), x) - v.begin()) #define ub(v, x) (int)(upper_bound(all(v), x) - v.begin()) template inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; } template inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return 1; } return 0; } template T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); } template T lcm(T a, T b) { return a / gcd(a, b) * b; } template T pow(T a, int b) { return b ? pow(a * a, b / 2) * (b % 2 ? a : 1) : 1; } const int mod = 1000000007; ll modpow(ll a, int b) { return b ? modpow(a * a % mod, b / 2) * (b % 2 ? a : 1) % mod : 1; } template ostream& operator<<(ostream& os, const vector& vec) { for (auto &vi: vec) os << vi << " "; return os; } template ostream& operator<<(ostream& os, const pair& p) { os << p.F << " " << p.S; return os; } template inline void add(T &a, int b) { a += b; if (a >= mod) a -= mod; } void solve(); int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int T; // cin >> T; T = 1; while (T--) { solve(); } } void solve() { int x, n, m; cin >> x >> n >> m; set a, b; rep(i, n) { int aa; cin >> aa; a.insert(aa); } rep(i, n) { int bb; cin >> bb; b.insert(bb); } if (a.count(x) && b.count(x)) cout << "MrMaxValu" << endl; else if (a.count(x)) cout << "MrMax" << endl; else if (b.count(x)) cout << "MaxValue" << endl; else cout << -1 << endl; }