#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, l, r) for (ll i = (l); i < (r); ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using pl = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
using vvvvl = vector<vector<vector<vector<ll>>>>;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <regex>
using mint=modint998244353;

vl solve1d(ll n){
    if(n==1)return {0};
    if(n==2)return {0,1};
    ll k=0;
    rep(i,0,22){
        if(n&(1<<i)){
            k=i;
        }
    }
    if((1<<k)==n)k--;
    vl s=solve1d(n-(1<<k));
    vl r=solve1d((1<<k));
    vl ans;
    ll c=0;
    ans.push_back(0);
    ll g=s[s.size()-1];
    ll gg=r[1];
    if(g!=gg){
    rep(i,0,r.size()){
        ll u=r[i];
        u|=gg;
        u|=g;
        if(!(r[i]&g))u^=gg;
        if(!(r[i]&gg))u^=g;
        r[i]=u;
    }
    }
    rep(i,0,s.size()){
        ans.push_back(s[i]+(1<<k));
    }
    rep(i,1,r.size())ans.push_back(r[i]);
    return ans;
}

vvl solve(ll h,ll w){
    ll u=1;
    ll v=1;
    ll f=0;
    ll g=0;
    rep(i,0,22)if((1<<i)>=h){
        u=(1<<i);
        f=i;
        break;
    }
    rep(i,0,22)if((1<<i)>=w){
        v=(1<<i);
        g=i;
        break;
    }
    vl c=solve1d(h);
    vl d=solve1d(w);
    vvl ans(h,vl(w));
    ll e=h-u/2;
    //cout<<e<<endl;
    ll ee=1;
    rep(i,0,22)if((1<<i)>e){
        ee=(1<<i);
        break;
    }

    rep(i,0,h){
        rep(j,0,w){
            ans[i][j]=u*d[j]+c[i];
        }
    }
    ll now=0;

    vvl ut(f+1,vl(g+1));
    vvvl r(f+1,vvl(g+1));
    rep(i,0,f+1){
        rep(j,0,g+1){
            if(i==0&&j==0)continue;
            ll c=111111111;
            if(i!=0){
                c=ut[i-1][j];
                if((h-1)&(1<<(i-1)))c|=(1<<(i+j-1));
            }
            ll d=111111111;
            if(j!=0){
                d=ut[i][j-1];
                if((w-1)&(1<<(j-1)))d|=(1<<(i+j-1));
            }
            if(c<d){
                ut[i][j]=c;
                r[i][j]=r[i-1][j];
                r[i][j].push_back(i-1);
            }
            else {
                ut[i][j]=d;
                r[i][j]=r[i][j-1];
                r[i][j].push_back(j-1+f);
            }
        }
    }
    vvl anss(h,vl(w));
    //rep(i,0,f+g)cout<<r[f][g][i]<<endl;
    rep(i,0,h){
        rep(j,0,w){
            rep(k,0,f+g){
                if(ans[i][j]&(1<<r[f][g][k]))anss[i][j]|=(1<<k);
            }
        }
    }
    return anss;
}

int main(){
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    ll h,w;
    cin>>h>>w;
    if(h%2!=0||w%2!=0){
        cout<<-1<<endl;
        return 0;
    }
    //auto u=solve1d(6);
    //rep(i,0,6)cout<<u[i]<<' ';
    //cout<<endl;
    auto ans=solve(h,w);
    auto ans2=solve(w,h);
    ll a=0;
    ll b=0;
    rep(i,0,h){
        rep(j,0,w){
            a=max(a,ans[i][j]);
            b=max(b,ans2[j][i]);
        }
    }
    if(a>b){
        rep(i,0,h)rep(j,0,w)ans[i][j]=ans2[j][i];
    }
    rep(i,0,h){
        rep(j,0,w){
            cout<<ans[i][j];
            if(j!=w-1)cout<<" ";
            else cout<<endl;
        }
    }
}