#include<bits/stdc++.h>
#define cout cerr
#define C(x,y) (x-y+p)%p 
#define debug cout<<"debug"<<endl;
using namespace std;
const int N=105;
const int M=20;
int n,p,L,G,t;
struct node {
	int a[13];
}idea[N];
bitset<N> f[2][M][M][N];
int read() {
	int x=0,f=0; char ch=getchar();
	while(!isdigit(ch)) {if(ch=='-') f=1; ch=getchar();}
	while(isdigit(ch)) {x=(x<<1)+(x<<3)+(ch^48); ch=getchar();}
	return f?-x:x;
}
int main()
{
	srand(time(0));
	n=read(),p=read();
	t=2*sqrt(n);
	for(int i=1;i<=n;i++) {
		for(int j=1;j<=12;j++) idea[i].a[j]=read();
	}
	L=read()%p,G=read()%p;
	random_shuffle(idea+1,idea+n+1);
	f[0][0][0][t].set(t);
	for(int i=1;i<=n;i++) {
		for(int l=0;l<p;l++) {
			for(int g=0;g<p;g++) {
				for(int x=0;x<=2*t;x++) {
					f[i&1][l][g][x].reset();
					f[i&1][l][g][x]|=f[(i&1)^1][C(l,idea[i].a[1])][C(g,idea[i].a[2])][x]<<1;
					f[i&1][l][g][x]|=f[(i&1)^1][C(l,idea[i].a[3])][C(g,idea[i].a[4])][x+1];
					f[i&1][l][g][x]|=f[(i&1)^1][C(l,idea[i].a[5])][C(g,idea[i].a[6])][x+1]>>1;
					f[i&1][l][g][x]|=f[(i&1)^1][C(l,idea[i].a[7])][C(g,idea[i].a[8])][x]>>1;
					f[i&1][l][g][x]|=f[(i&1)^1][C(l,idea[i].a[9])][C(g,idea[i].a[10])][x-1];
					f[i&1][l][g][x]|=f[(i&1)^1][C(l,idea[i].a[11])][C(g,idea[i].a[12])][x-1]<<1;
				}
			}
		}
	}
	if(f[n&1][L][G][t][t]) printf("Chaotic Evil");
	else printf("Not a true problem setter");
	return 0;
}