#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll mx=1e18;
struct BigInt{
	ll val[7];
	void init(){memset(val,0,sizeof(val));}
}f[1030];
BigInt operator+(BigInt a,BigInt b){
	ll lst=0;
	for(int i=0;i<7;++i){
		a.val[i]=a.val[i]+b.val[i]+lst;
		lst=a.val[i]/mx,a.val[i]%=mx;
	}return a;
}
BigInt operator-(BigInt a,BigInt b){
	ll lst=0;
	for(int i=0;i<7;++i){
		a.val[i]=a.val[i]-b.val[i]-lst,lst=0;
		while(a.val[i]<0)a.val[i]+=mx,++lst;
	}return a;
}
bool operator>=(BigInt a,BigInt b){
	for(int i=6;i>=0;--i){
		if(a.val[i]>b.val[i])return 1;
		if(a.val[i]<b.val[i])return 0;
	}return 1;
}
int ax[1030],ay[1030],id[1030],n,k,q,x,y;
char t[1030],res[1030];
int main(){
	n=960;cin>>k>>q>>x>>y;f[0].val[0]=f[1].val[0]=1ll;
	for(int i=2;i<n;++i)f[i]=f[i-1]+f[i-2];ax[0]=ay[0]=id[0]=1;
	for(int i=1;i<n;++i){
		if(i&1)ax[i]=ax[i-1]+1,ay[i]=ay[i-1],id[i]=id[i-1]+1;	
		else{
			if(i==2)ax[i]=ax[i-1],ay[i]=ay[i-1]+1,id[i]=id[i-1]+2;
			else ax[i]=ax[i-1],ay[i]=ay[i-1]+1,id[i]=id[i-1]+3;
		}
	}
	cout<<n-2<<endl;
	cout<<1<<" "<<1<<endl;
	cout<<2<<" "<<1<<endl;
	for(int i=2;i<=n/4;++i){
		cout<<i-1<<" "<<i<<endl;
		cout<<i<<" "<<i<<endl;
		cout<<i+1<<" "<<i<<endl;
		cout<<i+1<<" "<<i-1<<endl;
	}
	while(q--){
		for(int i=0;i<n-2;++i)res[i]='0';res[n-2]=0;
		scanf("%s",t+1);int id1=0,len=strlen(t+1);
		reverse(t+1,t+len+1);
		BigInt now;now.init();
		for(int l=1;l<=len;l+=18){
			int r=min(l+17,len);ll v=0;
			for(int i=r;i>=l;--i)v=v*10ll+(ll)(t[i]-'0');
			now.val[id1]=v;++id1;
		}
		for(int i=n-1;i>=0;--i)
		    if(now>=f[i]){
		    	now=now-f[i];
		    	res[id[i]-1]='1';
			}
		printf("%s\n",res);
	}
	return 0;
}