#include <bits/stdc++.h>
using namespace std;
template<class T>void sort(vector<T> &v){sort(v.begin(),v.end());}
template<class T>int lower_bound(vector<T> &v, T key){
	return distance(v.begin(), lower_bound(v.begin(),v.end(),key));
}
template<class T>int upper_bound(vector<T> &v, T key){
	return distance(v.begin(), upper_bound(v.begin(), v.end(), key));
}


int main(){
	int x,n,m;cin>>x>>n>>m;
	vector<int> mist(n),maxv(m);
	for(auto &i:mist)cin>>i;
	for(auto &i:maxv)cin>>i;
	
	int ans=0;
	for(auto i:mist)if(i==x){ans+=1;break;}
	for(auto i:maxv)if(i==x){ans+=2;break;}

	if(ans==0)cout<<-1<<endl;
	else if(ans==1)cout<<"MrMax"<<endl;
	else if(ans==2)cout<<"MaxValu"<<endl;
	else cout<<"MrMaxValu"<<endl;

	
	return 0;
}