#include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserve
#define OVER9000 1234567890
#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)
#define tisic 47
#define soclose 1e-8
#define chocolate win
// so much chocolate
#define patkan 9
#define ff first
#define ss second
#define abs(x) (((x) < 0)?-(x):(x))
#define uint unsigned int
#define dbl long double
#define pi 3.14159265358979323846
using namespace std;
// mylittledoge

using cat = long long;

#ifdef DONLINE_JUDGE
	// palindromic tree is better than splay tree!
	#define lld I64d
#endif

int main() {
	cin.sync_with_stdio(0);
	cin.tie(0);
	cout << fixed << setprecision(10);
	int N, M;
	cin >> N >> M;
	bool sw = false;
	if(N < M) swap(N, M), sw = true;
	vector< vector<char> > V(1<<N, vector<char>(1<<M, 0));
	for(int i = 0; i < (1<<M); i++)
		for(int j = 0; j < (1<<M); j++)
			V[i][j] = __builtin_popcount(i&j) & 1;
	for(int i = (1<<M); i < (1<<N); i++)
		for(int j = 0; j < (1<<M); j++)
			V[i][j] = V[i-(1<<M)][j];
	if(sw) {
		vector< vector<char> > VT(1<<M, vector<char>(1<<N, 0));
		for(int i = 0; i < (1<<N); i++)
			for(int j = 0; j < (1<<M); j++)
				VT[j][i] = V[i][j];
		V = VT;
		swap(N, M);
	}
	for(int i = (1<<N)-1; i > 0; i--)
		for(int j = (1<<M)-1; j > 0; j--)
			V[i][j] ^= V[i-1][j] ^ V[i-1][j-1] ^ V[i][j-1];
	for(int i = 1; i < (1<<N); i++) {
		for(int j = 1; j < (1<<M); j++) cout << (int)V[i][j];
		cout << "\n";
	}
	return 0;
}

// look at my code
// my code is amazing
