def bfs(i,j,x):
    global cnt0
    if b[i][j]==x: return
    c = 0
    b[i][j] = x
    q = [(i,j)]
    while q:
        vi,vj = q.pop()
        c += 1
        for ni,nj in [(vi-1,vj),(vi+1,vj),(vi,vj-1),(vi,vj+1)]:
            if 0 <= ni < h and 0 <= nj < w and b[ni][nj] != x:
                b[ni][nj] = x
                q.append((ni,nj))
    cnt0 += c if x==0 else -c
    return

h,w = map(int,input().split())
b = [list(map(int,input().split())) for _ in range(h)]
cnt0 = 0
for i in range(h):
    for j in range(w):
        if b[i][j]==0: cnt0 += 1

q = int(input())
for _ in range(q):
    r,c,x = map(int,input().split())
    if cnt0 != 0 and cnt0 != h*w:
        bfs(r-1,c-1,x)

if cnt0 in [0,h*w]:
    for i in range(h):
        for j in range(w):
            b[i][j] = x
    
for i in range(h):
    print(*b[i])