#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <map>
#include <vector>
using namespace std;
typedef long long LL;

LL f[2055][2055] = {0};
LL n,m;

void solve(LL x,LL y,LL d){
	if(d == 0){
		f[x][y] = 1;
		return;
	}
	solve(x,y,d - 1);
	solve(x + (1LL << d),y,d - 1);
	solve(x,y + (1LL << d),d - 1);
	solve(x + (1LL << d),y + (1LL << d),d - 1);
	f[x + (1LL << d) - 1][y + (1LL << d) - 1] = 1;
}

int main(){
	cin >> n >> m;
	solve(1,1,10);
	for(LL i = 1;i < (1LL << n);i ++){
		for(LL j = 1;j < (1LL << m);j ++){
			cout << f[i][j];
		}
		cout << endl;
	}
	return 0;
}
//