import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  /*
  debug {
    enum lim = 21;
    for (int m = 1; m <= lim; m = m * 2 + 1) for (int n = 1; m * n <= lim; n = n * 2 + 1) {
      int mx = -1;
      int[] pms;
      foreach (p; 0 .. 1 << (m * n)) {
        auto sum = new int[][](m + 1, n + 1);
        foreach (x; 0 .. m) foreach (y; 0 .. n) {
          sum[x + 1][y + 1] = sum[x + 1][y] + sum[x][y + 1] - sum[x][y] + ((p >> (x * n + y)) & 1);
        }
        int cnt;
        foreach (xa; 0 .. m) foreach (xb; xa + 1 .. m + 1) foreach (ya; 0 .. n) foreach (yb; ya + 1 .. n + 1) {
          if ((sum[xa][ya] - sum[xa][yb] - sum[xb][ya] + sum[xb][yb]) & 1) {
            ++cnt;
          }
        }
        if (chmax(mx, cnt)) {
          pms = [];
        }
        if (mx == cnt) {
          pms ~= p;
        }
      }
      writeln(m, " ", n, ": ", mx, " ", pms.length);
      {
        const p = pms[0];
        foreach (x; 0 .. m) {
          foreach (y; 0 .. n) {
            write((p >> (x * n + y)) & 1);
          }
          writeln();
        }
      }
      stdout.flush;
    }
  }
  //*/
  
  try {
    for (; ; ) {
      const A = readInt();
      const B = readInt();
      foreach (x; 1 .. 2^^A) {
        foreach (y; 1 .. 2^^B) {
          write((bsf(x) + bsf(y) == max(A, B) - 1) ? 1 : 0);
        }
        writeln();
      }
    }
  } catch (EOFException e) {
  }
}
