#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <list>
#include <tuple>
#include <bitset>
#include <ciso646>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef vector<ll> vec;

inline bool cheak(ll x, ll y, ll xMax, ll 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<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class _RanIt> inline string toString(_RanIt _First, _RanIt _Last, string sep) { if (_First == _Last)return ""; ostringstream sout; sout << *_First; for (_First = next(_First); _First != _Last; _First = next(_First)) { sout << sep << *_First; }return sout.str(); }
template<class _RanIt> inline string toString(_RanIt _First, _RanIt _Last, string sep, string sep2) { if (_First == _Last)return ""; ostringstream sout; sout << toString(all(*_First), sep); for (_First = next(_First); _First != _Last; _First = next(_First)) { sout << sep2 << toString(all(*_First), sep); }return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }
template<class T> inline T mypow(T x, ll n){ T res = 1; while (n > 0){ if (n & 1)res = res * x;	x = x * x;	n >>= 1; }return res; }
inline int gcd(ll a, ll b){ return b ? gcd(b, a%b) : a; }
inline int lcm(ll a, ll b){ return a / gcd(a, b) * b; }

#define For(i,a,b)	for(ll (i) = (a);i < (b);(i)++)
#define rep(i,n)	For(i,0,n)
#define rFor(i,a,b)	for(ll (i) = (a-1);i >= (b);(i)--)
#define rrep(i,n)	rFor(i,n,0)
#define clr(a)		memset((a), 0 ,sizeof(a))
#define mclr(a)		memset((a), -1 ,sizeof(a))
#define all(a)		(a).begin(),(a).end()
#define sz(a)		(sizeof(a))
#define tostr(a)	toString(a)

const ll dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }, dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };

const ll mod = 1e9 + 7;
const ll INF = 1e13 + 9;

#define int ll


signed main(){
	int h, w;
	cin >> h >> w;
	vector<vector<int>> a(h, vector<int>(w));
	rep(r, h)rep(c, w){
		cin >> a[r][c];
	}
	bool ef = false;
	int last = -1;
	int q;
	cin >> q;
	rep(_, q){
		int sr, sc, x;
		cin >> sr >> sc >> x;
		if (ef == false){
			sr--; sc--;
			if (a[sr][sc] == x)continue;
			queue<P> q;
			q.push(P(sr, sc));
			while (q.size()){
				int r = q.front().first,
					c = q.front().second;
				q.pop();
				if (a[r][c] == x)continue;
				rep(i, 4){
					int tr = r + dx[i], tc = c + dy[i];
					if (cheak(tr, tc, h, w) && !x == a[tr][tc]){
						q.push(P(tr, tc));
					}
				}
				a[r][c] = x;
			}

			int cnt = 0;
			rep(r, h){
				rep(c, w){
					cnt += a[r][c];
				}
			}
			if (cnt == 0 || cnt == w * h){
				ef = true;
				if (cnt == 0)last = 0;
				else last = 1;
			}
		}
		else{
			last = x;
		}		
	}

	rep(r, h){
		rep(c, w){
			if (ef)a[r][c] = last;
			cout << a[r][c];
			if (c < w - 1)cout << " ";
		}
		cout << endl;
	}
	return 0;
}