#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; }

struct UnionFind {
	vector<int> data;
	void init(int n) { data.assign(n, -1); }
	bool unionSet(int x, int y) {
		x = root(x); y = root(y);
		if(x != y) {
			if(data[y] < data[x]) swap(x, y);
			data[x] += data[y]; data[y] = x;
		}
		return x != y;
	}
	bool findSet(int x, int y) { return root(x) == root(y); }
	int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
	int size(int x) { return -data[root(x)]; }
};

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]);
		UnionFind uf; uf.init(H * W);
		rep(i, H) rep(j, W) {
			static const int dy[4] = {0,1,0,-1}, dx[4] = {1,0,-1,0};
			rep(d, 4) {
				int yy = i + dy[d], xx = j + dx[d];
				if(yy<0||yy>=H||xx<0||xx>=W) continue;
				if(A[yy][xx] == A[i][j]) {
					uf.unionSet(i * W + j, yy * W + xx);
				}
			}
		}
		vector<set<int> > neighbors(H * W);
		rep(i, H) rep(j, W) {
			static const int dy[4] = {0,1,0,-1}, dx[4] = {1,0,-1,0};
			rep(d, 4) {
				int yy = i + dy[d], xx = j + dx[d];
				if(yy<0||yy>=H||xx<0||xx>=W) continue;
				if(A[yy][xx] != A[i][j])
					neighbors[uf.root(i * W + j)].insert(uf.root(yy * W + xx));
			}
		}
		vi col(H * W, -1);
		rep(i, H) rep(j, W)
			col[i * W + j] = 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 = uf.root(R * W + C);
			if(col[a] == X) continue;
			set<int> s;
			each(i, neighbors[a]) {
				int b = uf.root(*i);
				if(uf.findSet(a, b)) continue;
				set<int> &t = neighbors[b];
				if(s.size() < t.size())
					t.swap(s);
				each(j, t)
					s.insert(*j);
				uf.unionSet(a, b);
			}
			a = uf.root(R * W + C);
			col[a] = X;
			neighbors[a].swap(s);
		}
		rep(i, H) {
			rep(j, W) {
				if(j != 0) putchar(' ');
				printf("%d", col[uf.root(i * W + j)]);
			}
			puts("");
		}
	}
	return 0;
}