// #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
using namespace std;

#define PB emplace_back
#define int long long
#define ll long long
#define vi vector<int>
#define siz(a) ((int) ((a).size()))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
void print(vi n) { rep(i, 0, siz(n) - 1) cerr << n[i] << " \n"[i == siz(n) - 1]; }

const int N = 1000;
int a, b, c, d, top, pw[16];
bool ans[N + 5];
char o[N + 5];
struct Bigint{
	int a[7];
	Bigint(int x=0)
	{
		a[0]=x;
		for(int i=1;i<7;i++) a[i]=0;
	}
	int& operator [](int w){return a[w];}
	void init()
	{
		cin >> 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');
	}
	void print()
	{
		for(int i=6;i>=0;i--)std::cout<<a[i]<<' ';
		std::cout<<'\n';
	}
	bool check()
	{
		for(int i=0;i<7;i++)if(a[i])return 1;
		return 0;
	}
} s[255][255], w[N + 5], x;
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;
}
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;
}
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;
}

void ins(int n, int m) {
	cout << n << ' ' << m << '\n';
	w[++top] = s[n][m] = s[n - 1][m] + s[n][m - 1];
}

signed main() {
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	pw[0]=1;
	rep(i, 1, 15) pw[i] = pw[i - 1] * 10;
	cin >> a >> b >> c >> d;
	cout << 239 * 4 + 1 << '\n';
	cout << "1 1\n";
	top = 1;
	s[1][1] = w[1] = Bigint(1);
	rep(i, 1, 239) ins(i, i + 1), ins(i, i + 2), ins(i + 1, i + 1), ins(i + 2, i + 1);
	while(b--) {
		x.init();
		per(i, top, 1) {
			ans[i] = x >= w[i];
			if(ans[i]) x = x - w[i];
		}
		rep(i, 1, top) cout << ans[i];
		cout << '\n';
	}
	return cerr << endl << 1.0 * clock() / CLOCKS_PER_SEC << endl, 0;
}