//#pragma GCC optimize("Ofast")
//#pragma GCC optimize "O3,omit-frame-pointer,inline"
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <iomanip>//fixed,setprecision
#include <limits.h>//INT_MAX
#include <math.h>//M_PI
#include <random>
#include <regex> // 正規表現
#include <time.h>
#include <fstream>
#include <array>
#include <bit>
#include <chrono>
#include <ranges>
#include <span>
#include <cmath>
#include <cstdint>
#include <complex>//複素数
//#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
//using mint = modint1000000007;
//using mint = modint998244353;
// using mint=modint;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)

int n,m;
int main(){
    cin>>n>>m;
    vector<vector<int>>ans((1<<n),vector<int>(1<<m,0));
    int bai=1;
    int cnt=0;
    for(int i=0;i<(1<<n)/2;i++){
        for(int j=0;j<(1<<m)/2;j++){
            ans[2*i+1][2*j]=4*cnt;
            ans[2*i][2*j]=4*cnt+1;
            ans[2*i+1][2*j+1]=4*cnt+2;
            ans[2*i][2*j+1]=4*cnt+3;
            cnt++;
        }
    }
    /*
    rep(i,1<<n)for(int j=i+1;j<(1<<n);j++){
        rep(k,(1<<m))for(int l=k+1;l<(1<<m);l++){
            int num=ans[i][k]^ans[i][l]^ans[j][k]^ans[j][l];
            cerr<<num<<" ";
        }
    }*/
    //cerr<<(1<<n)<<" "<<(1<<m)<<endl;
    rep(i,(1<<n)){
        rep(j,(1<<m)){
            cout<<ans[i][j]<<" ";
        }
        cout<<endl;
    }
    return  0;
}