#include<bits/stdc++.h>
#define Add(x,y) (x+y>=mod)?(x+y-mod):(x+y)
#define lowbit(x) x&(-x)
#define pi pair<ll,ll>
#define pii pair<ll,pair<ll,ll>>
#define iip pair<pair<ll,ll>,ll>
#define ppii pair<pair<ll,ll>,pair<ll,ll>>
#define fi first
#define se second
#define full(l,r,x) for(auto it=l;it!=r;it++) (*it)=x
#define Full(a) memset(a,0,sizeof(a))
#define open(s1,s2) freopen(s1,"r",stdin),freopen(s2,"w",stdout);
using namespace std;
typedef double db;
typedef unsigned long long ull;
typedef long long ll;
bool Begin;
const ll N=205;
inline ll read(){
    ll x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9'){
        if(c=='-')
          f=-1;
        c=getchar();
    }
    while(c>='0'&&c<='9'){
        x=(x<<1)+(x<<3)+(c^48);
        c=getchar();
    }
    return x*f;
}
inline void write(ll x){
	if(x<0){
		putchar('-');
		x=-x;
	}
	if(x>9)
	  write(x/10);
	putchar(x%10+'0');
}
bool F=0;
ll n,m,q,x,y,k;
ll a[N][N];
ll dx[]={0,0,1,-1},dy[]={1,-1,0,0};
ll dfs(ll x,ll y){
	if(x<1||x>n||y<1||y>m||a[x][y]==k)
	  return 0;
	a[x][y]=k;
	ll sum=1;
	for(int i=0;i<4;i++)
	  sum+=dfs(x+dx[i],y+dy[i]);
	return sum;
}
bool End;
int main(){
	n=read(),m=read();
	for(int i=1;i<=n;i++)
	  for(int j=1;j<=m;j++)
	    a[i][j]=read();
	q=read();
	while(q--){
		x=read(),y=read(),k=read();
		if(F)
		  continue;
		if(dfs(x,y)==n*m)
		  F=1; 
	}
	if(F){
		for(int i=1;i<=n;i++)
		  for(int j=1;j<=m;j++)
		    a[i][j]=k;
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			write(a[i][j]);
			putchar(' ');
		}
		putchar('\n');
	}
	cerr<<'\n'<<abs(&Begin-&End)/1048576<<"MB";
	return 0;
}