#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 = 0; i < n;i++){
		for (int j = 0; j < m;j++){
			cin >> board[i][j];
		}
	}
	int q;
	cin >> q;
	rep(i, q){
		int x, y, c;
		cin >> x >> y >> c;
		x--; y--;
		stack<pair<int, int>> st;
		st.push(make_pair(x, y));
		while (!st.empty()){
			pair<int, int> pos = st.top();
			st.pop();
			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 >= 0 && newX < m && newY >= 0 && newY < n){
					if (board[newY][newX] != c){
						st.push(make_pair(newX, newY));
					}
				}
			}
		}
	}
	for (int i = 0; i < n; i++){
		for (int j = 0; j < m; j++){
			cout << board[i][j];
			if (j != m-1)cout << " ";
		}
		cout << endl;
	}
}

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