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

const int N = (int)2e3;

int dat[N+5][N+5];

int fill(int x1, int x2, int y1, int y2) {
    int x_mid = (x1 + x2) / 2;
    int y_mid = (y1 + y2) / 2;

    dat[x_mid][y_mid] = 1;

    if (x2-x1 < y2-y1) {
        fill(x1,x2, y1, y_mid-1);
        fill(x1,x2, y_mid,y_mid);
        fill(x1,x2, y_mid+1, y2);
    } else if (x2-x1 > y2-y1) {
        fill(x1, x_mid-1, y1,y2);
        fill(x_mid,x_mid, y1,y2);
        fill(x_mid+1, x2, y1,y2);
    } else if (x1 != x2) {
        fill(x1,x_mid-1, y1,y_mid-1);
        fill(x1,x_mid-1, y_mid+1,y2);
        fill(x_mid+1,x2, y1,y_mid-1);
        fill(x_mid+1,x2, y_mid+1,y2);
    }
    return 0;
}

int main() {
    int n,m; scanf("%d %d", &n, &m);

    n = (1 << n) - 1;
    m = (1 << m) - 1;

    fill(1,n, 1,m);

    for (int i=1; i<=n; i++) {
        for (int j=1; j<=m; j++) {
            printf("%d", dat[i][j]);
        }
        printf("\n");
    }
    return 0;
}
