#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

class UnionFind{
public:
    UnionFind(int _n):n(_n), cnt(_n), par(_n), rank(_n), size(_n, 1){
        for(int i=0;i<n;++i) par[i]=i;
    }
    int find(int k){
        return (k==par[k])?k:(par[k]=find(par[k]));
    }
    int operator[](int k){
        return find(k);
    }
    int getSize(int k){
        return size[find(k)];
    }
    void unite(int x, int y){
        x = find(x); y = find(y);
        if(x==y) return;
        --cnt;
        if(rank[x] < rank[y]){
            par[x] = y;
            size[y] += size[x];
        }else{
            par[y] = x;
            size[x] += size[y];
            if(rank[y] == rank[x]) ++rank[y];
        }
    }
    int count(){
        return cnt;
    }
private:
    int n, cnt;
    vector<int> par, rank, size;
};

const int DY[] = {-1,0,1,0};
const int DX[] = {0,1,0,-1};

int A[200][200], col[200*200];
set<int> G[200*200];

int main(){
    int H, W;
    while(cin >> H >> W){
        rep(y, H)rep(x, W)scanf("%d", &A[y][x]);
        rep(i, H*W)G[i].clear();

        UnionFind uf(H*W);
        rep(y, H)rep(x, W){
            int id = y*W + x;
            col[id] = A[y][x];
            rep(i, 4){
                int ny = y + DY[i], nx = x + DX[i];
                if(ny >= 0 && nx >= 0 && ny < H&&nx < W){
                    int nid = ny*W + nx;
                    if(A[y][x] == A[ny][nx])uf.unite(id, nid);
                    else G[id].insert(nid);
                }
            }
        }
        int Q; cin >> Q;
        while(Q--){
            int Y, X, C;
            scanf("%d%d%d", &Y, &X, &C);
            --Y;
            --X;
            int id = uf.find(Y*W + X);
            if(col[id] == C)continue;
            col[id] = C;
            each(to, G[id]){
                uf.unite(id, to);
                int idid = uf[id];
                col[idid] = C;
                G[to].erase(id);
            }
            G[id].clear();
        }
        rep(y, H){
            rep(x, W){
                int id = uf[y*W + x];
                printf("%d%c", col[id], x == W - 1 ? '\n' : ' ');
            }
        }
    }
}