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
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-9;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

ll mod_pow(ll a, ll n, ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%m;
		a = a * a%m; n >>= 1;
	}
	return res;
}


struct modint {
	ll n;
	constexpr modint() :n(0) { ; }
	constexpr modint(const ll m) : n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
constexpr bool operator==(const modint a, const modint b)noexcept { return a.n == b.n; }
constexpr modint operator+=(modint &a, const modint b)noexcept { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
constexpr modint operator-=(modint &a, const modint b)noexcept { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
constexpr modint operator*=(modint &a, const modint b)noexcept { a.n = ((ll)a.n*b.n) % mod; return a; }
constexpr modint operator+(modint a, const modint b)noexcept { return a += b; }
constexpr modint operator-(modint a, const modint b)noexcept { return a -= b; }
constexpr modint operator*(modint a, const modint b)noexcept { return a *= b; }
constexpr modint operator^(const modint a, const ll n)noexcept {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
constexpr modint operator/(const modint a, const modint b)noexcept { return a * (b ^ (mod - 2)); }

const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;

int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };

void multi(vector<vector<char>> &c) {
	int h = c.size();
	int w = c[0].size();
	vector<vector<char>> res(2 * h + 1, vector<char>(2 * w + 1,'0'));
	rep(i, h)rep(j, w) {
		res[i][j] = c[i][j];
		res[i + h + 1][j] = c[i][j];
		res[i][j + w + 1] = c[i][j];
		res[i + h + 1][j + w + 1] = c[i][j];
	}
	res[h][w] = '1';
	swap(c, res);
}
void solve() {
	int h, w; cin >> h >> w;
	int dif = abs(h - w);
	int sz = 2 * (1 << dif) - 1;
	vector<vector<char>> ori;
	if (h <= w) {
		ori.resize(1, vector<char>(sz));
		rep(j, sz) {
			if (j % 2 == 0)ori[0][j] = '1';
			else ori[0][j] = '0';
		}
	}
	else {
		ori.resize(sz, vector<char>(1));
		rep(j, sz) {
			if (j % 2 == 0)ori[j][0] = '1';
			else ori[j][0] = '0';
		}
	}
	int t = min(h, w) - 1;
	rep(i, t)multi(ori);
	rep(i, ori.size()){
		rep(j, ori[i].size()) {
			cout << ori[i][j];
		}
		cout << endl;
	}
}
void solve2() {
	int n = 7;
	int sup = 16;
	rep(i, (1<<n)) {
		vector<bool> b(n);
		rep(j, n)b[j] = ((i >> j) & 1);
		int cnt = 0;
		rep(j, n) {
			int tmp = 0;
			Rep(k, j, n) {
				if (b[k])tmp ^= 1;
				if (tmp)cnt++;
			}
		}
		
		if (cnt >= sup) {
			string ans;
			rep(j, n) {
				if (b[j])ans.push_back('1');
				else ans.push_back('0');
			}
			cout << cnt << " " << ans << endl;
		}
	}
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//init();
	//int t; cin >> t; rep(i, t)solve();
	solve();
	stop
		return 0;
}
