// // Created by yamunaku on 2020/01/31. // #include using namespace std; #define rep(i, n) for(int i = 0; i < (n); i++) #define repl(i, l, r) for(int i = (l); i < (r); i++) #define per(i, n) for(int i = ((n)-1); i >= 0; i--) #define perl(i, l, r) for(int i = ((r)-1); i >= (l); i--) #define all(x) (x).begin(),(x).end() #define MOD9 998244353 #define MOD1 1000000007 #define IINF 1000000000 #define LINF 1000000000000000000 #define SP <<" "<< #define CYES cout<<"Yes"<; using mti = vector>; using vl = vector; using mtl = vector>; using pi = pair; using pl = pair; template using heap = priority_queue, function>; int main(){ // CFS; int x, n, m; cin >> x >> n >> m; bool a = false, b = false; int y; rep(i, n){ cin >> y; if(x == y) a = true; } rep(i, m){ cin >> y; if(x == y) b = true; } if(a){ if(b){ cout << "MrMaxValu" << endl; }else{ cout << "MrMax" << endl; } }else{ if(b){ cout << "MaxValu" << endl; }else{ cout << -1 << endl; } } return 0; }