#include<bits/stdc++.h>
using namespace std;
inline int qread()
{
	int a=0,f=1;char ch=getchar();
	while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
	while(isdigit(ch)){(a*=10)+=(ch^48);ch=getchar();}
	return a*f;
} 
int n,m,vis[1000];
long long pw[20];
char o[1010];
struct Bigint
{
	long long a[7];
	Bigint(int x=0)
	{
		a[0]=x;
		for(int i=1;i<7;++i)a[i]=0;
	}
	long long& operator [](int w){return a[w];}
	inline void init()
	{
		scanf("%s",o);
		int n=strlen(o);
		reverse(o,o+n);
		for(int i=0;i<7;++i)a[i]=0;
		for(int i=0;i<n;++i)a[i/15]+=pw[i%15]*(o[i]-'0');
		return ;
	}
	inline void print()
	{
		for(int i=6;i>=0;--i)printf("%lld ",a[i]);
		return puts(""),void();
	}
	inline bool check()
	{
		for(int i=0;i<7;++i)if(a[i])return 1;
		return 0;
	}
}A,f[500];
inline Bigint operator + (Bigint a,Bigint b)
{
	Bigint c;
	for(int i=0;i<7;++i)c[i]=a[i]+b[i];
	for(int i=0;i<6;++i)c[i+1]+=c[i]/pw[15],c[i]%=pw[15];
	return c;
}
inline Bigint operator - (Bigint a,Bigint b)
{
	Bigint c;
	for(int i=0;i<7;++i)c[i]=a[i]-b[i];
	for(int i=0;i<6;++i)if(c[i]<0)c[i]+=pw[15],c[i+1]--;
	return c;
}
inline bool operator >=(Bigint a,Bigint b)
{
	for(int i=6;i>=0;--i)if(a[i]!=b[i])return a[i]>b[i];
	return 1;
}
int main()
{
	pw[0]=1;
	for(int i=1;i<=15;++i)pw[i]=pw[i-1]*10;
	qread();m=qread(),qread();qread();
	f[1][0]=1,f[2][0]=2;n=960;
	printf("%d\n",n);
	printf("1 1\n");printf("1 2\n");printf("2 1\n");printf("2 2\n");
	for(int i=3,x=2,y=2,op=1;i<=480;++i,op^=1)
	{
		if(op)
		{
			++x;
			printf("%d %d\n",x,y-1);
			printf("%d %d\n",x,y);
		}
		else
		{
			++y;
			printf("%d %d\n",x-1,y);
			printf("%d %d\n",x,y);
		}
		f[i]=f[i-1]+f[i-2];
	}
	for(int i=1;i<=m;++i)
	{
		A.init();
		memset(vis,0,(n+1)<<2);
		for(int j=480;j;--j)
		{
			if(A>=f[j])
			{
				A=A-f[j];
				vis[j<<1]=1;
			}
		}
		for(int j=1;j<=n;++j)printf("%d",vis[j]);puts("");
	}
	return 0;	
}