#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
int s[1<<10][1<<10];
int ans[1<<10][1<<10];
int h[1<<10][1<<10];
void solve(int n){
    if(n==0) return;
    solve(n-1);
    for(int i=0; i<(1<<(n-1)); i++){
        for(int j=0; j<(1<<(n-1)); j++) h[i^(1<<(n-1))][j]=h[i][j], h[i][j^(1<<(n-1))]=h[i][j], h[i^(1<<(n-1))][j^(1<<(n-1))]=(1^h[i][j]);
    }
}
int main()
{
    int n, m;
    cin>>n>>m;
    bool rev=0;
    if(n>m) rev=1, swap(n, m);
    solve(n);
    for(int i=0; i<(1<<n); i++){
        for(int j=0; j<(1<<n); j++){
            if(h[i][j]){
                for(int k=0; k<(1<<(m-n)); k++) s[i][(j<<(m-n))^k]=1;
            }
        }
    }
    for(int i=1; i<(1<<n); i++){
        for(int j=1; j<(1<<m); j++){
            ans[i][j]=s[i][j-1]^s[i-1][j]^s[i-1][j-1]^s[i][j];
        }
    }
    if(rev){
        for(int i=1; i<(1<<m); i++){
            for(int j=1; j<(1<<n); j++) cout<<ans[j][i];
            cout<<endl;
        }
    }else{
        for(int i=1; i<(1<<n); i++){
            for(int j=1; j<(1<<m); j++) cout<<ans[i][j];
            cout<<endl;
        }
    }
    return 0;
}
