import sys

sys.setrecursionlimit(10 ** 6)
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(0, 1), (1, 0), (0, -1), (-1, 0)]

def main():
    def dfs(i, j, x):
        for di, dj in dij:
            ni, nj = i + di, j + dj
            if ni < 0 or nj < 0 or ni >= h or nj >= w: continue
            if aa[ni][nj] == x: continue
            aa[ni][nj] = x
            cnt[x]+=1
            cnt[1-x]-=1
            dfs(ni, nj, x)

    h, w = MI()
    aa = LLI(h)
    cnt = [0] * 2
    for i in range(h):
        for j in range(w):
            cnt[aa[i][j]] += 1
    q=II()
    rcx=LLI(q)
    for r,c,x in rcx:
        r, c = r - 1, c - 1
        if aa[r][c] == x: continue
        aa[r][c] = x
        dfs(r, c, x)
        if cnt[0]*cnt[1]==0:
            x=rcx[-1][-1]
            for i in range(h):
                for j in range(w):
                    aa[i][j]=x
            break
    for row in aa:print(*row)

main()