# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <tuple>
# include <unordered_map>
# include <numeric>
# include <complex>
# include <bitset>
# include <random>
# include <chrono>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
constexpr int INF = 2147483647;
constexpr int HINF = INF / 2;
constexpr double DINF = 100000000000000000.0;
constexpr double HDINF = 50000000000000000.0;
constexpr long long LINF = 9223372036854775807;
constexpr long long HLINF = 4500000000000000000;
const double PI = acos(-1);
int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); };
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); };
# define ALL(x)      (x).begin(),(x).end()
# define UNIQ(c)     (c).erase(unique(ALL((c))),(c).end())
# define LOWER(s)    transform(ALL((s)),(s).begin(),TL<char>)
# define UPPER(s)    transform(ALL((s)),(s).begin(),TU<char>)
# define mp          make_pair
# define eb          emplace_back
# define FOR(i,a,b)  for(LL i=(a);i<(b);i++)
# define RFOR(i,a,b) for(LL i=(a);i>=(b);i--)
# define REP(i,n)    FOR(i,0,n)
# define INIT        std::ios::sync_with_stdio(false);std::cin.tie(0)

int a[222][222];
int h, w;
int main() {
	cin >> h >> w;
	for (int i = 0; i < h; i++) for (int j = 0; j < w; j++) {
		cin >> a[i][j];
	}
	int Q;
	cin >> Q;
	bool done = false;
	int all = -1;
	for (int i = 0; i < Q; i++) {
		int r, c, x;
		cin >> r >> c >> x;
		r--; c--;
		if (done) {
			all = x;
			continue;
		}
		if (a[r][c] != x) {
			queue<pair<int, int>> que;
			int origin = a[r][c];
			que.push(mp(r, c));
			int cnt = 0;
			while (!que.empty()) {
				cnt++;
				auto p = que.front(); que.pop();
				a[p.first][p.second] = x;
				for (int k = 0; k < 4; k++) {
					int ny = p.first + dy[k];
					int nx = p.second + dx[k];
					if (ny < 0 || ny >= h || nx < 0 || nx >= w) continue;
					if (a[ny][nx] == origin) {
						que.push(mp(ny, nx));
						a[ny][nx] = x;
					}
				}
			}
			if (cnt >= h*w) done = true;
		}
	}
	if (done && all == -1) {
		for (int i = 0; i < h; i++) {
			for (int j = 0; j < w; j++) {
				cout << all;
				if (j < w - 1) cout << " ";
			}
			cout << endl;
		}
	}
	else {
		for (int i = 0; i < h; i++) {
			for (int j = 0; j < w; j++) {
				cout << a[i][j];
				if (j < w - 1) cout << " ";
			}
			cout << endl;
		}
	}
	return 0;
}