import sys
from collections import defaultdict

sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline

def main():
    def dfs(u):
        vis[u] = True
        for ku in to[u]:
            if vis[ku]: continue
            dfs(ku)
        top.append(u)
        return

    to = defaultdict(list)
    h, w = map(int, input().split())
    n = h * w
    aa = list(map(int, input().split()))
    bb = list(map(int, input().split()))
    aa.sort()
    bb.sort()
    for i, a in enumerate(aa):
        st = w * i + w - a
        for j in range(w - a):
            to[st - j] += [st - j - 1]
        for j in range(a - 1):
            to[st + j] += [st + j + 1]
    for j, b in enumerate(bb):
        st = w * (h - b) + j
        for i in range(h - b):
            to[st - i * w] += [st - (i + 1) * w]
        for i in range(b - 1):
            to[st + i * w] += [st + (i + 1) * w]
    #print(to)
    vis = [False] * n
    top = []
    for u in range(n):
        if vis[u]: continue
        dfs(u)
    #print(top)
    ans = [[-1] * w for _ in range(h)]
    for k, ij in enumerate(top[::-1]):
        i, j = divmod(ij, w)
        ans[i][j] = k + 1
    for x in ans:
        print(*x)

main()