#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }


int main() {
	int H; int W;
	while(~scanf("%d%d", &H, &W)) {
		vector<vi> A(H, vi(W));
		rep(i, H) rep(j, W)
			scanf("%d", &A[i][j]);
		int Q;
		scanf("%d", &Q);
		rep(ii, Q) {
			int R; int C; int X;
			scanf("%d%d%d", &R, &C, &X), -- R, -- C;
			int a = A[R][C];
			if(a != X) {
				A[R][C] = -1;
				vpii q;
				q.push_back(mp(R, C));
				for(int h = 0; h != q.size(); ++ h) {
					pii p = q[h];
					static const int dy[4] = {0,1,0,-1}, dx[4] = {1,0,-1,0};
					rep(d, 4) {
						int yy = p.first + dy[d], xx = p.second + dx[d];
						if(yy<0||yy>=H||xx<0||xx>=W) continue;
						if(A[yy][xx] != a) continue;
						A[yy][xx] = -1;
						q.push_back(mp(yy, xx));
					}
				}
				each(i, q)
					A[i->first][i->second] = X;
			}
		}
		rep(i, H) {
			rep(j, W) {
				if(j != 0) putchar(' ');
				printf("%d", A[i][j]);
			}
			puts("");
		}
	}
	return 0;
}