#include<bits/stdc++.h>
using namespace std;
int a[1025][1025],i,j,k,b[1025][1025],n,m;
bool flag;
int main()
{
	scanf("%d %d",&n,&m);
	if(n<m)
	{
		swap(n,m);
		flag=true;
	}
	a[1][1]=1;
	for(i=1;i<m;++i)
		for(j=0;j<(1<<i);++j)
			for(k=0;k<(1<<i);++k)
			{
				a[j+(1<<i)][k]=a[j][k+(1<<i)]=a[j][k];
				a[j+(1<<i)][k+(1<<i)]=a[j][k]^1;
			}
	for(i=(1<<m);i<(1<<n);++i)
		for(j=0;j<(1<<m);++j)
			a[i][j]=a[i-(1<<m)][j];
	for(i=(1<<n)-1;i>0;--i)
		for(j=(1<<m)-1;j>0;--j)
			a[i][j]^=a[i-1][j]^a[i][j-1]^a[i-1][j-1];
	if(flag)
	{
		for(i=1;i<(1<<n);++i)
			for(j=1;j<(1<<m);++j)
				b[j][i]=a[i][j];
		swap(n,m);
		for(i=1;i<(1<<n);++i)
			for(j=1;j<(1<<m);++j)
				a[i][j]=b[i][j];
	}
	for(i=1;i<(1<<n);++i)
	{
		for(j=1;j<(1<<m);++j)
			printf("%d",a[i][j]);
		printf("\n");
	}
}