#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,1,-1,0,1,1,-1,-1,0};
const ll dx[9]={1,0,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
} 
struct UnionFind {
    vector<int> par;
    vector<int> edge;
    vector<int> color;
    
    UnionFind(int n) : par(n, -1),edge(n, 0),color(n,0) {}

    int root(int x) {
        if (par[x] < 0) return x;
        else return par[x] = root(par[x]);
    }
    
    bool same(int x, int y) {
        return root(x) == root(y);
    }
    
    bool merge(int x, int y) {
        x = root(x); y = root(y);
        if (x == y) {
            edge[x]++;
            return false;
        }
        if (par[x] > par[y]) swap(x, y);
        par[x] += par[y];
        par[y] = x;
        edge[x] += edge[y]+1;
        return true;
    }
    
    int size(int x) {
        return -par[root(x)];
    }

    int get(int x){
        return color[root(x)];
    }
    void set(int x,int y){
        color[root(x)]=y;
    }
};

int main(){
    ll h,w;cin >> h >> w;
    UnionFind uf(h*w);
    rep(i,h)rep(j,w){
        ll p;cin >> p;
        uf.set(i*w+j,p);
    }
    vpl ps;
    rep(i,h)rep(j,w){
        rep(k,4){
            ll nx=i+dx[k],ny=j+dy[k];
            if(nx<0||ny<0||nx>=h||ny>=w)continue;
            if(uf.get(i*w+j)==uf.get(nx*w+ny))uf.merge(i*w+j,nx*w+ny);
            else ps.push_back({i*w+j,nx*w+ny});
        }
    }
    ll q;cin >> q;
    while(q--){
        ll x,y,t;cin >> x >> y >> t;x--;y--;
        if(uf.get(x*w+y)==t)continue;
        uf.set(x*w+y,t);
        vpl nst;
        for(auto [a,b]:ps){
            if(uf.get(a)==uf.get(b)){
                uf.merge(a,b);
            }
            else nst.push_back({a,b});
        }
    }
    rep(i,h){
        rep(j,w){
            cout << uf.get(i*w+j) <<" ";
        }
        cout << endl;
    }
}