We have a grid with (2^N - 1) rows and (2^M-1) columns. You are asked to write 0 or 1 in each of these squares. Let a_{i,j} be the number written in the square at the i-th row from the top and the j-th column from the left.

For a quadruple of integers (i_1, i_2, j_1, j_2) such that 1\leq i_1 \leq i_2\leq 2^N-1, 1\leq j_1 \leq j_2\leq 2^M-1, let S(i_1, i_2, j_1, j_2) = \displaystyle \sum_{r=i_1}^{i_2}\sum_{c=j_1}^{j_2}a_{r,c}. Then, let the oddness of the grid be the number of quadruples (i_1, i_2, j_1, j_2) such that S(i_1, i_2, j_1, j_2) is odd.

Find a way to fill in the grid that maximizes its oddness.

Constraints

* N and M are integers between 1 and 10 (inclusive).

Input

Input is given from Standard Input in the following format:


N M


Output

Print numbers to write in the grid so that its oddness is maximized, in the following format:


a_{1,1}a_{1,2}\cdots a_{1,2^M-1}
a_{2,1}a_{2,2}\cdots a_{2,2^M-1}
\vdots
a_{2^N-1,1}a_{2^N-1,2}\cdots a_{2^N-1,2^M-1}


If there are multiple solutions, you can print any of them.

Example

Input

1 2


Output

111
// #pragma GCC target("avx")  // CPU 処理並列化
// #pragma GCC optimize("O3")  // CPU 処理並列化
// #pragma GCC optimize("unroll-loops")  // 条件処理の呼び出しを減らす
// #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile("mov %%rsp, %%rbx\nmov %%rax, %%rsp":"=b"(stack_extend_origin_memory_):"a"((char*)stack_extend_memory_+(size)-1024));
// #define END_STACK_EXTEND asm volatile("mov %%rax, %%rsp"::"a"(stack_extend_origin_memory_));free(stack_extend_memory_);

#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
#include<numeric>
#include<unordered_set>
#include<unordered_map>
#include<complex>
using namespace std;
const long long mod=1000000007;
const long long inf=mod*mod;
const long long d2=(mod+1)/2;
const long double EPS=1e-9;
const double INF=1e+10;
const double PI=acos(-1.0);
const int C_SIZE = 3100000;
const int UF_SIZE = 3100000;
namespace{
	long long fact[C_SIZE];
	long long finv[C_SIZE];
	long long inv[C_SIZE];
	long long Comb(int a,int b){
	 	if(a<b||b<0)return 0;
	 	return fact[a]*finv[b]%mod*finv[a-b]%mod;
	}
	void init_C(int n){
		fact[0]=finv[0]=inv[1]=1;
		for(int i=2;i<n;i++){
			inv[i]=(mod-(mod/i)*inv[mod%i]%mod)%mod;
		}
		for(int i=1;i<n;i++){
			fact[i]=fact[i-1]*i%mod;
			finv[i]=finv[i-1]*inv[i]%mod;
		}
	}
	long long pw(long long a,long long b){
		if(a<0LL)return 0;
		if(b<0LL)return 0;
		long long ret=1;
		while(b){
			if(b%2)ret=ret*a%mod;
			a=a*a%mod;
			b/=2;
		}
		return ret;
	}
	long long pw_mod(long long a,long long b,long long M){
		if(a<0LL)return 0;
		if(b<0LL)return 0;
		long long ret=1;
		while(b){
			if(b%2)ret=ret*a%M;
			a=a*a%M;
			b/=2;
		}
		return ret;
	}
	int pw_mod_int(int a,int b,int M){
		if(a<0)return 0;
		if(b<0)return 0;
		int ret=1;
		while(b){
			if(b%2)ret=(long long)ret*a%M;
			a=(long long)a*a%M;
			b/=2;
		}
		return ret;
	}
	int ABS(int a){return max(a,-a);}
	long long ABS(long long a){return max(a,-a);}
	double ABS(double a){return max(a,-a);}
	int sig(double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }
	int UF[UF_SIZE];
	void init_UF(int n){
		for(int i=0;i<n;i++)UF[i]=-1;
	}
	int FIND(int a){
		if(UF[a]<0)return a;
		return UF[a]=FIND(UF[a]);
	}
	void UNION(int a,int b){
		a=FIND(a);b=FIND(b);if(a==b)return;
		if(UF[a]>UF[b])swap(a,b);
		UF[a]+=UF[b];UF[b]=a;
	}
}
// ここから編集しろ
int t[1100][1100];
int sum[1100][1100];
int ans[1100][1100];
char out[1100][1100];
void dfs(int a,int b,int c,int d){
	if(a==b||c==d)return;
	out[(a+b)/2][(c+d)/2]='0';
	dfs(a,(a+b)/2-1,c,(c+d)/2-1);
	dfs(a,(a+b)/2-1,(c+d)/2+1,d);
	dfs((a+b)/2+1,b,c,(c+d)/2-1);
	dfs((a+b)/2+1,b,(c+d)/2+1,d);
}
int main(){
	int a,b;scanf("%d%d",&a,&b);
	if(a==1&&b==1){
		printf("1\n");
		return 0;
	}
	int n=(1<<a)-1;
	int m=(1<<b)-1;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			out[i][j]='1';
		}
	}
	dfs(0,n-1,0,m-1);
	for(int i=0;i<n;i++)printf("%s\n",out[i]);
	// int a,b;
	// int ret=0;
	// scanf("%d%d",&a,&b);
	// for(int i=0;i<(1<<(a*b));i++){
	// 	for(int j=0;j<a*b;j++){
	// 		if(i&(1<<j))t[j/b][j%b]=1;
	// 		else t[j/b][j%b]=0;
	// 	}
	// 	for(int j=0;j<a;j++){
	// 		for(int k=0;k<b;k++){
	// 			sum[j+1][k+1]=t[j][k];
	// 		}
	// 	}
	// 	for(int j=0;j<=a;j++){
	// 		for(int k=0;k<=b;k++){
	// 			sum[j][k+1]+=sum[j][k];
	// 		}
	// 	}
	// 	for(int j=0;j<=a;j++){
	// 		for(int k=0;k<=b;k++){
	// 			sum[j+1][k]+=sum[j][k];
	// 		}
	// 	}
	// 	int cnt=0;
	// 	for(int j=0;j<a;j++){
	// 		for(int k=j;k<a;k++){
	// 			for(int l=0;l<b;l++){
	// 				for(int m=l;m<b;m++){
	// 					if(1&(sum[k+1][m+1]^sum[j][m+1]^sum[k+1][l]^sum[j][l]))cnt++;
	// 				}
	// 			}
	// 		}
	// 	}
	// 	ret=max(ret,cnt);
	// 	if(cnt==16){
	// 		for(int j=0;j<a;j++){
	// 			for(int k=0;k<b;k++)printf("%d",t[j][k]);
	// 			printf("\n");
	// 		}printf("\n");
	// 	}
	// }
	// printf("%d\n",ret);
}
