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

int n, m, g[1024][1024] = {0};
int e[11] = {0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023};

void construct (int x) {
    if (x == 1) {
        g[x][x] = 1; return;
    }
    int y = x - 1;
    construct (y);
    g[e[y] + 1][e[y] + 1] = 1;
    for (int i = e[y] + 2; i <= e[x]; i ++)
        for (int j = 1; j <= e[y]; j ++)
            g[i][j] = g[i - e[y] - 1][j];
    
    for (int i = 1; i <= e[x]; i ++)
        for (int j = e[y] + 2; j <= e[x]; j ++)
            g[i][j] = g[i][j - e[y] - 1];
}

int main () {
    cin >> n >> m;
    construct (max (n, m));
    for (int i = 1; i <= e[n]; i ++) {
        for (int j = 1; j <= e[m]; j ++)
            cout << g[i][j];
        cout << endl;
    }
    return 0;
}