#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

#define REP(i,s,e) for (i = s; i <= e; i++)
#define rep(i,n) REP (i,0,(int)(n)-1)
#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP (i,(int)(n)-1,0)
#define INF (int)1e8
#define MOD (int)(1e9+7)

typedef long long ll;

int a[200][200];
int h, w;

void dfs(int r, int c, int x) {
    a[r][c] = x;
    int i;
    int dxy[] = {1,0,-1,0};
    rep (i,4) {
        int nr = r + dxy[i];
        int nc = c + dxy[(i+1)%4];
        if (nr < 0 || nr >= h || nc < 0 || nc >= w) continue;
        if (a[nr][nc] != x)
            dfs(nr,nc,x);
    }
}

int main(void) {
    int i, j;
    scanf("%d%d",&h,&w);
    rep (i,h) rep (j,w) scanf("%d",&a[i][j]);

    int q;
    scanf("%d",&q);
    while (q--) {
        int r, c, x;
        scanf("%d%d%d",&r,&c,&x);
        r--; c--;
        if (a[r][c] != x) dfs(r,c,x);
    }
    rep (i,h) {
        rep (j,w)
            printf("%d ",a[i][j]);
        printf("\n");
    }
    return 0;
}