#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <queue>
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 main(void) {
    int i, j, H, W;
    int A[200][200];
    scanf("%d%d",&H,&W);
    rep (i,H) rep (j,W) scanf("%d",&A[i][j]);

    int Q;
    scanf("%d",&Q);
    bool same = false;
    int X;
    while (Q--) {
        int R, C;
        scanf("%d%d%d",&R,&C,&X);
        R--; C--;
        if (same) continue;
        if (A[R][C] == X) continue;
        A[R][C] = X;
        queue<pair<int,int>> q;
        q.push(make_pair(R,C));
        int dxy[] = {1,0,-1,0};
        int cnt = 0;
        while (!q.empty()) {
            int y = q.front().first;
            int x = q.front().second;
            q.pop();
            rep (i,4) {
                int ny = y + dxy[i];
                int nx = x + dxy[(i+1)%4];
                if (ny < 0 || ny >= H || nx < 0 || nx >= W) continue;
                if (A[ny][nx] != X) {
                    q.push(make_pair(ny,nx));
                    A[ny][nx] = X;
                }
            }
            cnt++;
        }
        if (cnt == H * W)
            same = true;
    }
    rep (i,H) {
        rep (j,W)
            printf("%d ",same ? X : A[i][j]);
        printf("\n");
    }
    return 0;
}