#include "bits/stdc++.h"
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> veci;
typedef vector<ll> vecll;
typedef vector<string> vecs;
template<class T,class U> using Hash=unordered_map<T,U>;
 
#define REP(i, a, n) for(ll i = a; i < (ll)(n); i++)
#define RREP(i, a, n) for(ll i = n-1; i >= (ll)(a); i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define MD 1000000007
#define _SPLIT " "
 
template<class T> T read(){T a;cin >> a;return a;}
template<class T> void read(T& a){cin >> a;}
template<class T,class ...Args> void read(T& a, Args&... args){cin >> a; read(args...);} 
template<class T> void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}}
template<class T> void write(T a){cout << setprecision(12) << a << endl;}
template<class T,class ...Args> void write(T a, Args... args){cout << setprecision(12) << a << _SPLIT; write(args...);}
template<class T> void warr(vector<T> a, const char* c = " "){cout << a[0];for(int i = 1; i < (int)a.size(); i++)cout << c << a[i];cout << endl;;}
template<class T> void warr(T a, int n, const char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;}
void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}}
void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}}
ll gcd(ll a, ll b){while(true){ll k = a % b;if(k == 0)return b;a = b;b = k;}}
ll comb(ll n, ll m){ll p=1;m=min(m,n-m);for(ll i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;}

struct Info{
    Info(int c):
    color(c),n(1){}
    int color;
    Info* root=nullptr;
    unordered_set<Info*> st;
    int n;
};

int h,w;
int a[200][200];
Info* p[200][200]={0};
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};

typedef pair<int,int> pai;

void paint(int sx,int sy,Info* info){
    queue<pai> q;
    q.push(pai(sx,sy));
    if(info!=nullptr)
        p[sy][sx]=info;
    int at=a[sy][sx];
    Info* my_info=p[sy][sx];
    bool vis[200][200]={0};
    while(!q.empty()){
        pai tp=q.front();
        q.pop();
        vis[tp.second][tp.first]=true;
        rep(i,4){
            int cx=tp.first+dx[i];
            int cy=tp.second+dy[i];
            if(cx<0||cx>=w||cy<0||cy>=h)continue;
            if(vis[cy][cx])continue;
            if(info!=nullptr&&at==a[cy][cx]){
                p[cy][cx]=info;
                info->n++;
                q.push({cx,cy});
            }
            if(info==nullptr){
                if(at==a[cy][cx])q.push({cx,cy});
                else my_info->st.insert(p[cy][cx]);
            }
        }
    }
}

Info* find_root(Info* info){
    while(info->root!=nullptr){
        info=info->root;
    }
    return info;
}

int main(void)
{
    cin>>h>>w;
    rep(i,h)rep(j,w)cin>>a[i][j];
    rep(i,h)rep(j,w)if(p[i][j]==nullptr)paint(j,i,new Info(a[i][j]));
    rep(i,h){
        bool find=false;
        rep(j,w){
            if(p[i][j]->st.size()==0)paint(j,i,nullptr);
            if(p[i][j]->st.size()==0){find=true;break;}
        }
        if(find)break;
    }
    int q;
    read(q);
    rep(i,q){
        int y,x,c;
        read(y,x,c);
        y--;x--;
        Info* root=find_root(p[y][x]);
        if(root->color==c)continue;
        auto st=root->st;
        root->color=c;
        root->st.clear();
        for(auto at1:st){
            at1->root=root;
            for(auto at2:at1->st)
                if(at2!=root)root->st.insert(at2);
        }
    }
    rep(i,h){
        rep(j,w)cout<<((j==0)?"":" ")<<find_root(p[i][j])->color;
        cout<<endl;
    }
    return 0;
}