#include <bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
#define repb(i,a,b) for(int i=a;i>=b;i--)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define int long long
#define fi first
#define se second
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;

int a[210][210];
int dy[4]={1,-1,0,0};
int dx[4]={0,0,1,-1};
int h,w,q;
bool f[210][210];

void dfs(int r,int c,int color,int x){
	f[r][c]=true;
	a[r][c]=x;
	rep(i,0,4){
		int ny=r+dy[i];
		int nx=c+dx[i];
		if(0<=ny && ny<h && 0<=nx && nx<w && a[ny][nx]==color && f[ny][nx]==false){
			dfs(ny,nx,color,x);
		}
	}
	return;
}

signed main(){
	cin>>h>>w;
	rep(i,0,h) rep(j,0,w) cin>>a[i][j];
	cin>>q;
	rep(i,0,q){
		int r,c,x;
		cin>>r>>c>>x;
		r--; c--;
		int color=a[r][c];
		rep(i,0,h) rep(j,0,w) f[i][j]=false;
		dfs(r,c,color,x);
	}
	rep(i,0,h){
		rep(j,0,w){
			cout<<(j?" ":"")<<a[i][j];
		}
		cout<<endl;
	}
}