#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;

int main(){
  int X,N,M;
  cin>>X>>N>>M;
  vector<int> A(N),B(M);
  rep(i,N) cin>>A[i];
  rep(i,M) cin>>B[i];

  bool isA=false,isB=false;
  rep(i,N) if(A[i]==X) isA=true;
  rep(i,M) if(B[i]==X) isB=true;

  if(isA&&isB) cout<<"MrMaxValu"<<endl;
  else if(isA) cout<<"MrMax"<<endl;
  else if(isB) cout<<"MaxValu"<<endl;
  else cout<<-1<<endl;

  return 0;
}