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

#define all(s) s.begin(), s.end()
#define pb push_back
#define ii pair<int, int>
#define x first
#define y second
#define bit(x, y) ((x >> y) & 1)
#define sz(s) ((int) (s).size())

int ans[2000][2000];

void solve(int x, int y, int u, int v) {
    if (u == 0 || v == 0) return;
    ans[x + (1 << (u - 1))][y + (1 << (v - 1))] = 1;
    solve(x, y, u - 1, v - 1);
    solve(x + (1 << (u - 1)), y, u - 1, v - 1);
    solve(x, y + (1 << (v - 1)), u - 1, v - 1);
    solve(x + (1 << (u - 1)), y + (1 << (v - 1)), u - 1, v - 1);
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0); 
    cout.tie(0);
    int n, m;
    cin >> n >> m;
    solve(0, 0, n, m);
    for (int i = 1; i < (1 << n); i++) {
        for (int j = 1; j < (1 << m); j++) {
            cout << ans[i][j];
        }
        cout << '\n';
    }
    return 0;
}