//  yukicoder -  - 307  / 2016-03-01
#include<iostream>
#include<vector>
#include<cassert>
#include<string>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<tuple>
using namespace std;

typedef long long ll;
typedef pair<ll,ll> pll;
typedef ll int__;
#define rep(i,j) for(int__ i=0;i<(int__)(j);i++)
#define repeat(i,j,k) for(int__ i=(j);i<(int__)(k);i++)
#define all(v) v.begin(),v.end()

template<typename T>ostream& operator << (ostream &os , const vector<T> &v){
    rep(i,v.size()) os << v[i] << (i!=v.size()-1 ? " " : "\n"); return os;
}
template<typename T>istream& operator >> (istream &is , vector<T> &v){
    rep(i,v.size()) is >> v[i]; return is;
}

#ifdef DEBUG
void debug(){ cerr << endl; }
#endif
template<class F,class...R> void debug(const F &car,const R&... cdr){
#ifdef DEBUG
    cerr << car << " "; debug(cdr...);
#endif
}


const int dx[] = { 0, 1, 0, -1};
const int dy[] = {-1, 0, 1, 0};

struct UnionFind{
    int n;
    vector<int> p;
    UnionFind(int nn):n(nn+1){
        p.resize(n);
        rep(i,n) p[i] = i;
    }
    int root(int x){
        if(p[x] == x) return x;
        else return p[x] = root(p[x]);
    }
    void unite(int x,int y){
        x = root(x);
        y = root(y);
        if(x != y) p[y] = x;
    }
    bool query(int x,int y){
        return root(x) == root(y);
    }
};


// ---------- --------- ---------
int H, W;
vector<vector<int>> G;


int ptoi(int x, int y){
    return y * W + x;
}

bool is_in_field(int x, int y){
    return 0 <= x and x < W and 0 <= y and y < H;
}

void scroll(UnionFind &ut, vector<int> color, int x, int y){
    int xx = x, yy = y;
    // up!
    while(true){
        int nx = x + dx[0];
        int ny = y + dy[0];
        if(is_in_field(nx, ny) and ut.query(ptoi(x,y), ptoi(nx,ny))){
            x = nx;
            y = ny;
        } else break;
    }
    vector<vector<bool>> visited(H, vector<bool>(W));
    int nxt_dir = 0;
    stack<int> merge;
    // walk boundary
    while(true){
        if(visited[y][x]){
            rep(i, 2){
                int nx1 = x + dx[i], nx2 = x + dx[(i+2)%4];
                int ny1 = y + dy[i], ny2 = y + dy[(i+2)%4];
                if(not( is_in_field(nx1, ny1) and
                        ut.query(ptoi(x,y),ptoi(nx1,ny1))) and
                   not( is_in_field(nx2, ny2) and
                        ut.query(ptoi(x,y),ptoi(nx2,ny2)))
                   ){
                    rep(j, 2){
                        int nx = x + dx[(i+1+2*j)%4], ny = y + dy[(i+1+2*j)%4];
                        if(is_in_field(nx, ny) and not visited[ny][nx]){
                            x = nx;
                            y = ny;
                            goto START;
                        }
                    }
                }
            }
            break;
        }
  START:
        
        visited[y][x] = true;
        rep(d, 4){
            int nd = (nxt_dir + d) % 4;
            int nx = x + dx[nd];
            int ny = y + dy[nd];
            if(is_in_field(nx, ny)){
                if(ut.query(ptoi(x,y),ptoi(nx,ny))){
                    x = nx;
                    y = ny;
                    nxt_dir = (nd + 3) % 4;
                    break;
                } else {
                    if(color[ut.root(ptoi(x,y))] == color[ut.root(ptoi(nx,ny))]){
                        merge.push(ptoi(nx,ny));
                    }
                }
            }
        }
    }
    while(not merge.empty()){
        ut.unite(ptoi(xx, yy), merge.top());
        merge.pop();
    }
}

bool solve(){
    cin >> H >> W;
    G.resize(H, vector<int>(W));
    rep(i, H) cin >> G[i];

    UnionFind ut(H*W);
    vector<int> color(H*W);
    rep(y, H) rep(x, W) color[ptoi(x, y)] = G[y][x];
            
    rep(y,H){
        rep(x, W){
            rep(dir, 4){
                int nx = x + dx[dir];
                int ny = y + dy[dir];
                if(0 <= nx and nx < W and
                   0 <= ny and ny < H){
                    if(G[y][x] == G[ny][nx]){
                        ut.unite(ptoi(x, y), ptoi(nx, ny));
                    }
                }
            }
        }
    }

    int Q; cin >> Q;
    rep(i, Q){
        int y, x, c; cin >> y >> x >> c;
        y--; x--;
        int p = ptoi(x, y);
        color[ut.root(p)] = c;
        scroll(ut, color, x, y);
    }

    rep(y, H){
        rep(x, W){
            cout << color[ut.root(ptoi(x, y))] << (x != W-1 ? " " : "\n");
        }
    }
    
    return false;
}

int main()
{
    ios::sync_with_stdio(false);
    while(solve());
    return 0;
}