#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

const int DY[] = {-1,0,1,0};
const int DX[] = {0,1,0,-1};

int H, W, A[200][200], vis[200][200];

void dfs(int y, int x, int col, int &cnt, bool flag){
    if(A[y][x] != col){
        if(vis[y][x]++)return;
        if(flag){
            A[y][x] = col;
        } else{
            ++cnt;
        }
        rep(i, 4){
            int ny = y + DY[i], nx = x + DX[i];
            if(ny >= 0 && ny < H&&nx >= 0 && nx < W)dfs(ny, nx, col, cnt, flag);
        }
    }
}

int main(){
    while(cin >> H >> W){
        rep(y, H)rep(x, W)scanf("%d", &A[y][x]);

        int cnt = 0, lastCol = 0;
        int Q; cin >> Q;
        while(Q--){
            int Y, X, C;
            scanf("%d%d%d", &Y, &X, &C);
            --Y;
            --X;
            lastCol = C;
            if(cnt == H*W || A[Y][X]==C)continue;
            MEM(vis, 0);
            dfs(Y, X, C, cnt, 1);
            MEM(vis, 0);
            dfs(Y, X, 1 - C, cnt, 0);
        }
        if(cnt == H*W)rep(y, H)rep(x, W)A[y][x] = lastCol;
        rep(y, H){
            rep(x, W){
                printf("%d%c", A[y][x], x == W - 1 ? '\n' : ' ');
            }
        }
    }
}