from collections import deque

H,W = map(int,input().split())
A = [int(i) for i in input().split()] 
B = [int(i) for i in input().split()] 
A.sort()
B.sort()

edge = [[] for i in range(H*W)]
cnt = [0 for j in range(H*W)]
for i in range(H) :
    for j in range(W-A[i]) :
        edge[i*W+j].append(i*W+j+1)
        cnt[i*W+j+1]+=1
    for j in range(W-A[i],W-1) :
        edge[i*W+j+1].append(i*W+j)
        cnt[i*W+j]+=1


for j in range(W) :
    for i in range(H-B[j]) :
        edge[i*W+j].append((i+1)*W+j)
        cnt[(i+1)*Wj]+=1
    for i in range(H-B[j],H-1) :
        edge[(i+1)*W+j].append(i*W+j)
        cnt[i*W+j]+=1

ans = [0 for j in range(H*W)]
sy = [0,0,H-1,H-1]
sx = [0,W-1,0,W-1]
val = H*W

for n in range(4):
    q = deque([])
    if cnt[sy[n]*W+sx[n]] == 0 and ans[sy[n]*W+sx[n]] == 0:
        q.append([sy[n],sx[n]])
    while len(q)>0:
        y,x = q[-1]
        q.pop()
        ans[y*W+x] = val
        val -= 1
        for j in edge[y*W+x]:
            s = j//W
            t = j%W
            cnt[s*W+t] -= 1
            if cnt[s*W+t] == 0 and ans[s*W+t] == 0:
                q.append([s,t])

for i in range(H):
    for j in range(W):
        print(ans[i*W+j],"", end="")
    print()