#include "bits/stdc++.h"

using namespace std;

typedef long long ll;
typedef long double ld;

#define mp make_pair
#define pb push_back
#define FOR(i,a,x) for(int i=(a);i<(x);i++)
#define rep(i,n)	FOR(i,0,n)
#define xFOR(i,a,x) for(int i=(a);i<=(x);i++)
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define lb(vec,a) lower_bound(vec.begin(),vec.end())
#define ub(vec,a) upper_bound(vec.begin(),vec.end())
#define uniq(vec) vec.erace(unique(vec.begin(),vec.end(),vec.end))
#define mp1(a,b,c) P1(a,P(b,c))
#define all(x) (x).begin(),(x).end()

#define debug(X) cout<<"["<<#X<<"]"<<X<<endl;



inline bool cheak(int x, int y, int xMax, int yMax) { return x >= 0 && y >= 0 && xMax > x && yMax > y; }
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<typename T> inline string toString(const T &a) { ostringstream oss; oss << a; return oss.str(); }
template<class T> inline T sqr(T x) { return x*x; }


const int dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }, dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
//const int mod = 1000000007;
const int INF = 1e9;
const int NIL = -1;

#define MAX_N 10010
#define MAX_K 100
#define MAX_V 10000

int h, w,q;
int board[201][201];

int main() {
	cin >> h >> w;
	for (int i = 1; i <= h; i++) {
		for (int j = 1; j <= w; j++) {
			cin >> board[i][j];
		}
	}
	cin >> q;
	bool end = false;
	int last;
	for (int i = 0; i < q; i++) {
		int x, y, c;
		cin >> y >> x >> c;
		vector<pair<int, int>> st;
		st.push_back(make_pair(x, y));
			int f = board[y][x];
		int cnt = 0;
		if (end) {
			last = c;
			continue;
		}
		if (c != f) {
			while(!st.empty()) {
				pair<int, int>pos = st.front();
				st.pop_back();
				cnt++;
				board[pos.second][pos.first] = c;
				for (int j = 0; j < 4; j++) {
					int newX = pos.first + dx[j];
					int newY = pos.second + dy[j];
					if (newX >= 1 && newX <= w&&newY >= 1 && newY <= h) {
						if (board[newY][newX] == f) {
							st.push_back(make_pair(newX, newY));
							board[newY][newX] = c;
						}
					}
				}
			}
		}
		if (cnt == h*w)end = true;
	}
	if (end){
		for (int i = 1; i <= h; i++) {
			for (int j = 1; j <= w; j++) {
				cout << last;
				if (j != w)cout << " ";
			}
			cout << endl;
		}
	}
	else {
		for (int i = 1; i <= h; i++) {
			for (int j = 1; j <= w; j++) {
				cout << board[i][j];
				if (j != h)
					cout << " ";
			}
			cout << endl;
		}
	}
	return 0;
}