#include <iostream>
#include <vector>
#include <cstdio>
#include <ctime>
#include <bitset>
#include <string>
#include <algorithm>

using namespace std;
typedef bitset<62750> bits;

int h,w;

int main_(){
	scanf("%d%d", &h,&w);
	vector<vector<int>> a(h, vector<int>(w));
	for(int i=0; i<h; i++){
		for(int j=0; j<w; j++){
			scanf("%d", &a[i][j]);
		}
	}

	bits s;
	bits filter;
	for(int i=0; i<h; i++){
		for(int j=0; j<w; j++){
			int pos = i*(w+1) + j;
			if(a[i][j]) s.set(pos);
			filter.set(pos);
		}
	}

	auto dbg = [&](){

		string tmp = s.to_string();
		reverse(tmp.begin(), tmp.end());
		for(int i=0; i<h; i++){
			for(int j=0; j<w; j++){
				printf("%c%s", tmp[i*(w+1)+j], (j==w-1)?"\n":" ");
			}
		}
		puts("");
	};

	bool filled = false;
	int last = -1;

	int q;
	scanf("%d", &q);
	while(q--){
		int r,c,x;
		scanf("%d%d%d", &r,&c,&x);
		r--; c--;

		last = x;
		if(filled) continue;

		if(x == s[r*(w+1)+c]) continue;

		bits z;
		z.set(r*(w+1) + c);
		if(x==0){
			while(1){
				bits last = z;
				z |= ((z<<1) | (z>>1) | (z<<(w+1)) | (z>>(w+1))) & s;
				
				if(z == last) break;
			}
		}else{
			bits ns = (~s & filter);
			while(1){
				bits last = z;
				z |= ((z<<1) | (z>>1) | (z<<(w+1)) | (z>>(w+1))) & ns;
				
				if(z == last) break;
			}
		}
		s ^= z;
		int cnt = s.count();
		filled = cnt == 0 || cnt == h*w;

		//dbg();
	}

	if(filled){
		s.reset();
		if(last == 1) s.flip();
	}

	string tmp = s.to_string();
	reverse(tmp.begin(), tmp.end());
	for(int i=0; i<h; i++){
		for(int j=0; j<w; j++){
			printf("%c%s", tmp[i*(w+1)+j], (j==w-1)?"\n":" ");
		}
	}
	return 0;
}

int main(){
	auto start = clock();
	main_();
	cerr << clock() - start << " [ms]" << endl;
	return 0;
}