#include <bits/stdc++.h>
using namespace std;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int H, W;
    cin >> H >> W;
    vector<int> A(H * W);
    vector<deque<int>> B(H * W);
    vector<int> parent_or_size(H * W, -1);

    auto f = [&](int y, int x) { return y * W + x; };
    auto g = [&](int v) { return make_pair(v / W, v % W); };

    function<int(int)> leader = [&](int v){
        if(parent_or_size[v] < 0) return v;
        return parent_or_size[v] = leader(parent_or_size[v]);
    };

    auto merge = [&](int u, int v){
        int x = leader(u), y = leader(v);
        if(x == y)return;
        if(-parent_or_size[x] < -parent_or_size[y]) swap(x, y);
        parent_or_size[x] += parent_or_size[y];
        parent_or_size[y] = x;
        B[x].insert(B[x].end(), B[y].begin(), B[y].end());
    };

    auto change = [&](int v, int c){
        int ld = leader(v);
        if(A[ld] == c) return;
        A[ld] = c;
        int n = B[ld].size();
        while(n--){
            int y, x, v;
            v = B[ld].front();
            B[ld].pop_front();
            tie(y, x) = g(v);
            int cnt = 0, cnt2 = 0;
            for(int i = 0; i < 4; i++){
                int ny = y + (i == 0) - (i == 1);
                int nx = x + (i == 2) - (i == 3);
                if(ny < 0 || nx < 0 || ny >= H || nx >= W) continue;
                cnt++;
                if(c == A[leader(f(ny, nx))]){
                    cnt2++;
                    merge(ld, f(ny, nx));
                }
            }
            if(cnt2 < cnt) B[ld].push_back(v);
        }
    };

    for(int y = 0; y < H; y++){
        for(int x = 0; x < W; x++){
            cin >> A[f(y, x)];
            B[f(y, x)].push_back(f(y, x));
            if(y && A[f(y, x)] == A[f(y - 1, x)]) merge(f(y, x), f(y - 1, x));
            if(x && A[f(y, x)] == A[f(y, x - 1)]) merge(f(y, x), f(y, x - 1));
        }
    }

    int Q, y, x, c;
    cin >> Q;
    while(Q--){
        cin >> y >> x >> c;
        change(f(--y, --x), c);
    }

    for(int y = 0; y < H; y++){
        for(int x = 0; x < W; x++){
            cout << A[leader(f(y, x))] << (x + 1 == W ? '\n' : ' ');
        }
    }
}