#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=2e3+5,M=3e5+5,K=(1<<15)+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n=20,m=20;
char s[N][N];
void Solve(){
	int i,j;
	for(i=1;i<=n-2;i++) {
		if(i&1) for(j=1;j<=m;j++) s[i][j]='1';
		else {
			for(j=1;j<=m;j++) s[i][j]='0';
			if((i/2)&1) s[i][1]='1';
			else s[i][m]='1';
		}
	}
	s[n-2][m]='1';
	for(i=1;i<=m;i++) s[n-1][i]=s[n][i]='0';
	for(i=1;i<n/2;i++) s[n-1][i]=s[n-1][m-i+1]='1';
	for(i=1;i<n/2;i+=2) s[n][i]=s[n][n-i+1]='1';
	printf("%d %d\n",n,m);
	for(i=1;i<=n;i++){
		for(j=1;j<=m;j++) Pc(s[i][j]);Pc('\n');
	}
}
int main(){
	int t;
	// scanf("%d",&t);
	t=1;
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}