def graycode(l,r):
    if l==1:
        return [0]
    if l==2:
        return [0,1]
    if l//2<=r:
        ret=graycode(l//2,r-l//2)
        ret=ret[::-1]+ret
        for i in range(l//2,l):
            ret[i]^=l//2
        return ret
    else:
        ret=graycode(l//2,r)
        ret=ret+ret[::-1]
        for i in range(l//2,l):
            ret[i]^=l//2
        return ret

def nibeki(i):
    ret=1
    while ret<i:
        ret*=2
    return ret

def nibeki2(i):
    ret=1
    while ret<=i:
        ret*=2
    ret//=2
    return ret
    
def sw(x,p,q):
    lx=len(x)
    for i in range(lx):
        pa=x[i]&p
        qa=x[i]&q
        x[i]|=p
        x[i]-=p
        x[i]|=q
        x[i]-=q
        if qa:
            x[i]|=p
        if pa:
            x[i]|=q
    return x

def grc(h):
    m=nibeki(h)
    if m==h:
        return graycode(m,0)
    m//=2
    sm=grc(h-m)
    gc=graycode(m,0)
    
    sd=sm[0]^sm[-1]
    gd=gc[0]^gc[-1]
    
    sw(gc,gd,sd)
    
    df=gc[-1]^sm[0]
    
    for i in range(m):
        gc[i]^=df
    
    for i in range(h-m):
        sm[i]+=m
        gc.append(sm[i])
    
    return gc
    
    
H,W=map(int,input().split())
if H%2==1 or W%2==1:
	print(-1)
	exit()
h=grc(H)
w=grc(W)
hh=nibeki2(H-1)
ww=nibeki2(W-1)

hs=[]
ws=[]
while hh:
    hs.append((hh,(H-1)&hh))
    hh//=2

while ww:
    ws.append((ww,(W-1)&ww))
    ww//=2

hp=[]
for i in hs:
    if i[1]:
        hp.append([])
    hp[-1].append((i[0],0))
wp=[]
for i in ws:
    if i[1]:
        wp.append([])
    wp[-1].append((i[0],1))
hp.append([])
wp.append([])
dp=[[1<<60]*len(wp) for i in range(len(hp))]
bef=[[-1]*len(wp) for i in range(len(hp))]

dp[0][0]=0

for i in range(len(hp)):
    il=len(hp[i])
    for j in range(len(wp)):
        jl=len(wp[j])
        if i!=len(hp)-1:
            if dp[i+1][j]>(((dp[i][j]<<1)+1)<<(il-1)):
                dp[i+1][j]=(((dp[i][j]<<1)+1)<<(il-1))
                bef[i+1][j]=1
        if j!=len(wp)-1:
            if dp[i][j+1]>(((dp[i][j]<<1)+1)<<(jl-1)):
                dp[i][j+1]=(((dp[i][j]<<1)+1)<<(jl-1))
                bef[i][j+1]=2

arr=[]
nx=len(hp)-1
ny=len(wp)-1
while nx>0 or ny>0:
    if bef[nx][ny]==1:
        arr.append(1)
        nx-=1
    else:
        arr.append(2)
        ny-=1
arr=arr[::-1]

order=[]
for i in arr:
    if i==1:
        for j in hp[0]:
            order.append(j)
        hp=hp[1:]
    else:
        for j in wp[0]:
            order.append(j)
        wp=wp[1:]

ans=[[0]*W for i in range(H)]

for i in range(H):
    for j in range(W):
        v=pow(2,len(order)-1)
        for b,p in order:
            if p==0:
                if h[i]&b:
                    ans[i][j]|=v
            else:
                if w[j]&b:
                    ans[i][j]|=v
            v//=2
for i in ans:
    print(*i)