#include int main(void) { int n,a,b,ai[100000]={},bj[100000]={},i,j,acount=0,bcount=0; //入力 scanf("%d %d %d\n",&n,&a,&b); for (i = 1;i<=a;i++){ scanf("%d",&ai[i-1]); } for (j = 1;j<=b;j++){ scanf("%d",&bj[j-1]); } //検索 for (i=1;i<=a;i++){ if (n==ai[i-1]){ acount = 1; break; } } for (j=1;j<=b;j++){ if (n==bj[j-1]){ bcount = 1; break; } } //出力 if (acount==1 && bcount==1){ printf("MrMaxValu\n"); }else if (acount==1){ printf("MrMax\n"); }else if (bcount==1){ printf("MaxValu\n"); }else{ printf("-1\n"); } return 0; }