#include <bits/stdc++.h>
using namespace std;

//int n,m,k;
int n,m;
const int N=1e6+10,M=5e3,mod=998244353;

int sa[N];

void solve() {
    n=20,m=20;
    vector<string>s(21);
    s[1]= "01111111101111111111";
    s[2]= "01000000101100000011";
    s[3]= "01000000101100000011";
    s[4]= "01000000101100000011";
    s[5]= "01000000100000000011";
    s[6]= "01111110100101111111";
    s[7]= "01000000000100000011";
    s[8]= "01111111110111101111";
    s[9]= "00000000110100000000";
    s[10]="10000000110100000000";
    s[11]="10000000110111111110";
    s[12]="11110111110001111110";
    s[13]="11110110000101111110";
    s[14]="11000000100100000010";
    s[15]="11100000100100000110";
    s[16]="11000000100100000010";
    s[17]="11000000100100000010";
    s[18]="11011110100101111010";
    s[19]="11000000100100000010";
    s[20]="11111111100001111110";
    cout<<n<<" "<<m<<"\n";
    for(int i=1;i<=n;i++) {
        for(int j=0;j<m;j++) {
            if(s[i][j]=='1')s[i][j]='0';
            else s[i][j]='1';
        }
    }
    for(int i=1;i<=n;i++) {
        cout<<s[i]<<"\n";
    }
}


signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int T=1;
    //cin>>T;
    while(T--)solve();
    return 0;
}
/*

1
6 8
1 2 5 3 4 7
2 4 1 4 3 4 2 5
1
12323 34534534534 45
*/