// bzoj1923

#include<algorithm>

#include<iostream>

#include<cstdlib>

#include<cstring>

#include<cstdio>

#include<cmath>

#include<map>

#define LL long long

#define inf 2147483640

#define Pi acos(-1,0)

#define free(a) freopen(a".in","r",stdin),freopen(a".out","w",stdout);

using namespace std;

const int maxn=2010;

int a[maxn][maxn],n,m,ans;

char ch[maxn];

void Gauss() {

	ans=0;

	for (int r,i=1;i<=n;i++) {

		r=i;

		while (!a[r][i] && r<=m) r++;

		if (r==m+1) {ans=0;return;}

		ans=max(ans,r);

		if (r!=i) for (int j=1;j<=n+1;j++) swap(a[i][j],a[r][j]);

		for (int j=1;j<=m;j++) if (j!=i && a[j][i]) {

				for (int k=i;k<=n+1;k++) a[j][k]^=a[i][k];

			}

	}

}

int main() {

	scanf("%d%d",&n,&m);

	for (int x,i=1;i<=m;i++) {

		scanf("%s%d",ch,&x);

		for (int j=0;j<n;j++) a[i][j+1]=ch[j]-'0';

		a[i][n+1]=x;

	}

	Gauss();

	if (ans==0) puts("Cannot Determine");

	else {

		printf("%d\n",ans);

		for (int i=1;i<=n;i++) {

			if (a[i][n+1]) puts("?y7M#");

			else puts("Earth");

		}

	}

    return 0;

}