#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
#define PI 3.141592653589793

int main(){
  int X, N, M; cin >> X >> N >> M; X--;
  bool mr[101010], ma[101010];
  rep(i, N){
    int a; cin >> a; a--; mr[a]=true;
  }
  rep(i, M){
    int b; cin >> b; b--; ma[b]=true;
  }
  if(ma[X] && mr[X] ) cout << "MrMaxValu" << endl;
  else if(ma[X]) cout << "MaxValu" << endl;
  else if(mr[X]) cout << "MrMax" << endl;
  else cout << -1 << endl;
}