#include <bits/stdc++.h>
 
#define f first
#define s second
#define pb push_back
#define mp make_pair
 
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
 
const int N = (int)2e5 + 123, inf = 1e9, mod = 1e9 + 7;
const ll INF = 1e18;
 
int n, m, a[1100][1100];
void solve(int n, int m){
	if(n > m){
		solve(n / 2, m);
		for(int i = 0; i < n / 2; i++)
			for(int j = 0; j < m; j++)
				a[i + n / 2 + 1][j] = a[i][j];
		for(int j = 0; j < m; j++)
			a[n / 2][j] = 0;
		return;
	}
	if(m > n){
		solve(n, m / 2);
		for(int i = 0; i < n; i++)
			for(int j = 0; j < m / 2; j++)
				a[i][j + m / 2 + 1] = a[i][j];
		for(int i = 0; i < n; i++)
			a[i][m / 2] = 0;	
		return;
	}
	if(n == 1){
		a[0][0] = 1;
		return;
	}
	solve(n / 2, m / 2);
	for(int i = 0; i < n / 2; i++)
		for(int j = 0; j < n / 2; j++)
			a[i + n / 2 + 1][j + n / 2 + 1] = a[i][j + n / 2 + 1] = a[i + n / 2 + 1][j] = a[i][j];
	for(int i = 0; i < n; i++)
		a[i][n / 2] = a[n / 2][i] = 0;
	a[n / 2][m / 2] = 1;	
}
int main()
{
	cin >> n >> m;
	solve((1 << n) - 1, (1 << m) - 1);
	for(int i = 0; i < ((1 << n) - 1); i++){
		for(int j = 0; j < ((1 << m) - 1); j++)
			printf("%d", a[i][j]);
		printf("\n");
	}
}
