#include<bits/stdc++.h>
using namespace std;
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
#define memo(a,v) memset(a,v,sizeof(a))
#define pb push_back
#define all(a) a.begin(),a.end()
#define eps (1e-9)
#define inf (1<<29)
#define i64 long long
#define u64 unsigned i64
#define AIN(a,b,c) assert(a<=b && b<=c)
#define MAXN 1000000000
#define MAXK 100000

typedef pair<int,int> pii;

int a[MAXK];

int main(){
    int t, n, k, i;
    i64 sum, cur, cnt=0;
    scanf("%d",&t);
    AIN(1,t,100000);
    while(t--){
        scanf("%d %d",&n,&k);
        AIN(1,n,MAXN);
        AIN(0,k, min(n, MAXK));
        cnt+=k;
        for(i = 0;i<k;i++){
            scanf("%d",&a[i]);
            AIN(1,a[i],n);
        }
        sort(a, a+k);
        sum = 0;
        for(i = 0;i<k;i++){
            cur = a[i]*(i64)(a[i]-1)/2 - sum;
            if (cur<a[i])
                break;
            sum += a[i];
        }
        if(i<k){
            if(a[i]%2==0)
              puts("Mom");
            else puts("Chef");
        }
        else {
            cur = n*(i64)(n+1)/2 - sum+1;
            if(cur%2==0)
              puts("Mom");
            else puts("Chef");
        }
    }
 //   AIN (1, cnt, 500000);
	return 0;
}