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([])
order=[]
while len(hp)>=2 or len(wp)>=2:
    if len(hp[0])<len(wp[0]):
        for i in wp[0]:
            order.append(i)
        wp=wp[1:]
    elif len(hp[0])>len(wp[0]):
        for i in hp[0]:
            order.append(i)
        hp=hp[1:]
    else:
        lg=len(hp[0])
        c=0
        for i in hp:
            if len(i)<lg:
                c=169231
                break
            if len(i)>lg:
                break
            c+=1
        d=0
        for i in wp:
            if len(i)<lg:
                d=169231
                break
            if len(i)>lg:
                break
            d+=1
        if c<d:
            for i in hp[0]:
                order.append(i)
            hp=hp[1:]
        else:
            for i in wp[0]:
                order.append(i)
            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)