#include <bits/stdc++.h>
#define GET_MACRO(a, b, c, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define rep2(i, a) rep3 (i, 0, a)
#define rep3(i, a, b) for (int i = (a); i < (b); i++)
#define repr(...) GET_MACRO(__VA_ARGS__, repr3, repr2)(__VA_ARGS__)
#define repr2(i, a) repr3 (i, 0, a)
#define repr3(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define chmin(a, b) ((b) < a && (a = (b), true))
#define chmax(a, b) (a < (b) && (a = (b), true))
using namespace std;
typedef long long ll;

int a[200][200], num, h, w;
int dy[] = {0, 1, 0, -1};
int dx[] = {1, 0, -1, 0};

void dfs(int y, int x, int c1, int c2) {
	if (y < 0 || y >= h || x < 0 || x >= w || a[y][x] != c1) return;
	num -= a[y][x];
	a[y][x] = c2;
	num += a[y][x];
	rep (k, 4) {
		dfs(y + dy[k], x + dx[k], c1, c2);
	}
}

int main() {
	cin >> h >> w;
	rep (i, h) rep (j, w) {
		cin >> a[i][j];
		num += a[i][j];
	}
	int q;
	cin >> q;
	while (q--) {
		int r, c, x;
		scanf("%d%d%d", &r, &c, &x);
		r--; c--;
		if (a[r][c] != x) dfs(r, c, a[r][c], x);
		if (num == 0 || num == h * w) break;
	}

	if (num == 0 || num == h * w) {
		while (q--) {
			int r, c, x;
			scanf("%d%d%d", &r, &c, &x);
			if (a[0][0] != x) {
				a[0][0] = x;
			}
		}
		rep (i, h) rep (j, w) a[i][j] = a[0][0];
	}
	rep (i, h) {
		rep (j, w) cout << a[i][j] << " ";
		cout << endl;
	}
	return 0;
}