# 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 h, w;

int a[1010][1010];
bool boo = false;

void bfs(int sy,int sx,int c) {
	int cnt = 0;
	queue<pair<int, int>> que;
	que.push(pair<int, int>(sx, sy));
	a[sy][sx] = c;
	while (que.size()) {
		cnt++;
		pair<int, int> p = que.front();
		que.pop();
		for (int i = 0; i < 4; i++) {
			int nx = p.first + dx[i], ny = p.second + dy[i];
			if (0 <= nx&&nx < w && 0 <= ny&&ny < h &&a[ny][nx] != c) {
				que.push(pair<int, int>(nx, ny));
				a[ny][nx]=c;
			}
		}
	}
	if (cnt >= h + w)boo = true;
}

int main() {
	cin >> h >> w;
	
	REP(i, h)REP(j, w) {
		cin >> a[i][j];
	}
	int q;
	cin >> q;
	int all;
	REP(Q, q) {
		int r, c, x;
		cin >> r >> c >> x;
		r--, c--;
		if (boo) {
			all = x;
			continue;
		}
		if(a[r][c]!=x)bfs(r, c, x);
	}
	REP(i, h) {
		REP(j, w) {
			if (j)cout << " ";
			if(!boo)cout << a[i][j];
			else cout << all;
		}
		cout << endl;
	}
	//system("pause");
}