#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define mem(a) memset(a,0,sizeof(a))
#define pd(a) printf("%.10f\n",a)
#define pb(a) push_back(a)
#define in(a) insert(a)
#define pi M_PI
#define R cin>>
#define F first
#define S second
#define C class
#define ll long long
#define ln cout<<'\n'
#define _(_1,_2,_3,N,...)N
#define pr(...) _(__VA_ARGS__,pr3,pr2,pr1)(__VA_ARGS__)
template<C T>void pr1(T a){cout<<a;ln;}
template<C T,C T2>void pr2(T a,T2 b){cout<<a<<' '<<b;ln;}
template<C T,C T2,C T3>void pr3(T a,T2 b,T3 c){cout<<a<<' '<<b<<' '<<c;ln;}
template<C T>void PR(T a,int n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
bool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;

int p[10001],r[10001];
void init(){rep(i,10001)p[i]=i,r[i]=0;}
int find(int x){return (p[x]==x)?x:(p[x]=find(p[x]));}
void unite(int x,int y) {
  x=find(x),y=find(y);
  if(x==y)return;
  if(r[x]<r[y])p[x]=y;
  else{p[y]=x;if(r[x]==r[y])r[x]++;}
}
bool same(int x,int y){return find(x)==find(y);}

void Main() {
  init();
  int n,m;
  cin >> n >> m;
  int a[n][m];
  rep(i,n)rep(j,m)cin >> a[i][j];
  rep(i,n)rep(j,m){
    if(i&&a[i][j]==a[i-1][j]) unite(i*m+j,(i-1)*m+j);
    if(j&&a[i][j]==a[i][j-1]) unite(i*m+j,i*m+j-1);
  }
  int T;
  cin >> T;
  while(T--) {
    int x,y,z;
    cin >> x >> y >> z;
    x--,y--;
    rep(i,n)rep(j,m){
      if(same(x*m+y,i*m+j)) a[i][j]=z;
    }
    rep(i,n)rep(j,m){
      rep(k,4){
        int xx=i+dx[k],yy=j+dy[k];
        if(!check(n,m,xx,yy)) continue;
        if(same(x*m+y,xx*m+yy)&&a[xx][yy]==a[i][j]) unite(x*m+y,i*m+j);
      }
    }
  }
  rep(i,n)PR(a[i],m);
}

int main() {
  ios::sync_with_stdio(0);cin.tie(0);
  Main();return 0;
}