// https://atcoder.jp/contests/hitachi2020/tasks/hitachi2020_e
//
#![allow(unused_imports)]
use std::io::*;
use std::io::Write;
use std::fmt::*;
use std::str::*;
use std::cmp::*;
use std::collections::*;

// Input macros.
// Original by tanakh: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};

    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };

    ($iter:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };

    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };

    ($iter:expr, [ next / $t:tt ]) => {
        {
            let len = read_value!($iter, usize);
            (0..len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
        }
    };

    ($iter:expr, switch) => {
        {
            let ty = read_value!($iter, i32);
            if ty == 1 {
                vec![ty, read_value!($iter, i32), read_value!($iter, i32)]
            } else if ty == 2 {
                vec![ty, read_value!($iter, i32)]
            } else {
                vec![ty, read_value!($iter, i32)]
            }
        }
    };

    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };

    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };

    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_macros)]
macro_rules! read_line {
    ($t:tt) => {
        {
            let mut s = String::new();
            std::io::stdin().read_line(&mut s).unwrap();
            s.trim_right().parse::<$t>().unwrap()
        }
    }
}

#[allow(unused_macros)]
macro_rules! dvec {
    ($t:expr ; $len:expr) => {
        vec![$t; $len]
    };

    ($t:expr ; $len:expr, $($rest:expr),*) => {
        vec![dvec!($t; $($rest),*); $len]
    };
}

#[allow(unused_macros)]
macro_rules! ifv {
    ($t:expr, $a:expr, $b: expr) => {
        if $t { $a } else { $b }
    }
}

#[allow(unused_macros)]
macro_rules! fill {
    ($t:expr, $v:expr) => {
        for i in 0..$t.len() {
            $t[i] = $v;
        }
    };
}

#[allow(unused_macros)]
macro_rules! join {
    ($t:expr, $glue:expr) => {
        $t.into_iter().map(|w| w.to_string()).collect::<Vec<_>>().join($glue)
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        println!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*);
    }
}

// ===

fn count(a: Vec<Vec<i32>>) -> i32 {
    let n = a.len();
    let m = a[0].len();

    let mut sum = dvec!(0; n+1, m+1);
    for i in 0..n {
        for j in 0..m {
            sum[i+1][j+1] = sum[i+1][j] + sum[i][j+1] - sum[i][j] + a[i][j];
        }
    }

    let mut odd = 0;
    for i in 0..n {
        for j in 0..m {
            for k in i..n {
                for l in j..m {
                    if sum[k+1][l+1] - sum[k+1][j] - sum[i][l+1] + sum[i][j] % 2 == 1 {
                        odd += 1;
                    }
                }
            }
        }
    }
    odd
}

fn solve(n: usize, m: usize) {
    let a = n*m;
    let mut ans = 0;
    let mut best = vec![];
    for ptn in 0..1<<a {
        let mut table = dvec!(0; n, m);
        for i in 0..n*m {
            if ptn>>i&1 == 1 {
                table[i/m][i%m] = 1;
            }
        }
        let ct = count(table.clone());
        if ans < ct {
            ans = ct;
            best.clear();
            best.push(table);
        } else if ans == ct {
            best.push(table);
        }
    }
    debug!(n, m, ans, best);
}

fn make(n: usize, m: usize) -> Vec<Vec<i32>> {
    let mut table = dvec!(0; n, m);

    if n == 1 {
        table[0][m/2] = 1;
    } else if m == 1 {
        table[n/2][0] = 1;
    } else {
        let sub = make(n/2, m/2);
        table[n/2][m/2] = 1;
        for i in 0..n/2 {
            for j in 0..m/2 {
                for h in 0..2 {
                    for w in 0..2 {
                        table[i+h*(n/2+1)][j+w*(m/2+1)] = sub[i][j];
                    }
                }
            }
        }
    }
    table
}

fn main() {
    input! {
        n: usize, m: usize
    };

    let a = make((1<<n)-1, (1<<m)-1);
    for row in a {
        println!("{}", join!(row, ""));
    }
}


Measured memory_bytes: 8444