#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0;i < n;i++)
#define P(p) cout<<(p)<<endl;
using namespace std;
typedef long long ll;
int dx[] = { 0, 1, 0, -1 };
int dy[] = { -1, 0, 1, 0 };

int sttoi(std::string str) {
	int ret;
	std::stringstream ss; ss << str;
	ss >> ret;
	return ret;
}

ll gcd(ll a, ll b){
	if (b > a)swap(a, b); if (b == 0)return a; else{ return gcd(b, a%b); }
}

void solve() {
	int n, m;
	cin >> n >> m;
	int board[201][201];
	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= m; j++){
			cin >> board[i][j];
		}
	}
	int q;
	cin >> q;
	bool flag1 = true;
	bool flag2 = true;
	bool end = false;
	int last;
	rep(i, q){
		int x, y, c;
		cin >> y >> x >> c;
		if (!flag2){
			end = true;
			if (i == q - 1){
				last = c;
			}
		}
		else{
			stack<pair<int, int>> st;
			st.push(make_pair(x, y));
			int f = board[y][x];
			int colo = board[1][1];
			flag1 = true;
			for (int i = 1; i <= n; i++){
				for (int j = 1; j <= m; j++){
					if (board[i][j] != colo){
						flag1 = false;
					}
				}
			}
			if (flag1){
				flag2 = false;
				continue;
			}
			while (!st.empty()){
				pair<int, int> pos = st.top();
				st.pop();
				board[pos.second][pos.first] = 2;
				for (int j = 0; j < 4; j++){
					int newX = pos.first + dx[j];
					int newY = pos.second + dy[j];
					if (newX >= 1 && newX <= m && newY >= 1 && newY <= n){
						if (board[newY][newX] == f){
							st.push(make_pair(newX, newY));
						}
					}
				}
			}
			for (int j = 1; j <= n; j++){
				for (int k = 1; k <= m; k++){
					if (board[j][k] == 2){
						board[j][k] = c;
					}
				}
			}
		}
	}
	if (end){
		for (int i = 1; i <= n; i++){
			for (int j = 1; j <= m; j++){
				cout << last;
				if (j != m)cout << " ";
			}
			cout << endl;
		}
	}
	else{
		for (int i = 1; i <= n; i++){
			for (int j = 1; j <= m; j++){
				cout << board[i][j];
				if (j != m)cout << " ";
			}
			cout << endl;
		}
	}
}

int main() {
	solve();
	return 0;
}