#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int B=6,N=1005;
const ll P=1e18;
struct bignum{
ll a[B];
bignum(){memset(a,0,sizeof(a));}
ll& operator [](const int x){return a[x];}
}f[N];
bignum operator +(bignum a,bignum b){
	ll ls=0;
	for(int i=0;i<B;++i){
		a[i]+=b[i]+ls;
		ls=a[i]/P,a[i]%=P;
	}
	return a;
}
bignum operator -(bignum a,bignum b){
	ll ls=0;
	for(int i=0;i<B;++i){
		a[i]-=b[i]+ls,ls=0;
		while(a[i]<0)a[i]+=P,++ls;
	}
	return a;
}
bool operator >=(bignum a,bignum b){
	for(int i=B-1;~i;--i)if(a[i]!=b[i])return a[i]>b[i];
	return true;
}
int n=480,K,Q,X,Y,x[N],y[N],id[N];
bool vis[N];
char s[N];
int main(){
	scanf("%d%d%d%d",&K,&Q,&X,&Y);
	f[0][0]=f[1][0]=1;
	for(int i=2;i<=n;++i)f[i]=f[i-1]+f[i-2];
	x[0]=y[0]=id[0]=1;
	for(int i=1;i<n;++i){
		if(i&1)x[i]=x[i-1]+1,y[i]=y[i-1],id[i]=id[i-1]+1;
		else x[i]=x[i-1],y[i]=y[i-1]+1,id[i]=id[i-1]+2+(i!=2);
	}
	printf("%d\n",958);
	printf("1 1\n2 1\n");
	for(int i=2;i<=240;++i){
		printf("%d %d\n",i-1,i);
		printf("%d %d\n",i,i);
		printf("%d %d\n",i+1,i);
		printf("%d %d\n",i+1,i-1);
	}
	while(Q--){
		for(int i=1;i<=958;++i)vis[i]=false;
		scanf("%s",s+1);
		int ln=strlen(s+1);
		reverse(s+1,s+ln+1);
		bignum c;
		for(int i=1,o=0;i<=ln;i+=18,++o)
			for(int k=min(i+17,ln);k>=i;--k)c[o]=c[o]*10+s[k]-'0';
		for(int i=n;~i;--i)if(c>=f[i])c=c-f[i],vis[id[i]]=true;
		for(int i=1;i<=958;++i)putchar(vis[i]?'1':'0');
		putchar(10);
	}
	return 0;
}