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 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=nibeki(H)
ww=nibeki(W)
hmx=0
wmx=0
for i in range(H):
    for j in range(W):
        hmx=max(hmx,w[j]*hh+h[i])
        wmx=max(wmx,w[j]+ww*h[i])
if hmx<wmx:
    for i in range(W):
        w[i]*=hh
else:
    for i in range(H):
        h[i]*=ww
ans=[[0]*W for i in range(H)]
for i in range(H):
    for j in range(W):
        ans[i][j]=h[i]+w[j]
for i in ans:
    print(*i)