#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define mem(a) memset(a,0,sizeof(a))
#define pd(a) printf("%.10f\n",a)
#define pb(a) push_back(a)
#define in(a) insert(a)
#define pi M_PI
#define R cin>>
#define F first
#define S second
#define C class
#define ll long long
#define ln cout<<'\n'
#define _(_1,_2,_3,N,...)N
#define pr(...) _(__VA_ARGS__,pr3,pr2,pr1)(__VA_ARGS__)
template<C T>void pr1(T a){cout<<a;ln;}
template<C T,C T2>void pr2(T a,T2 b){cout<<a<<' '<<b;ln;}
template<C T,C T2,C T3>void pr3(T a,T2 b,T3 c){cout<<a<<' '<<b<<' '<<c;ln;}
template<C T>void PR(T a,int n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
bool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;

void Main() {
  int n,m;
  cin >> n >> m;
  int a[n][m];
  rep(i,n)rep(j,m)cin >> a[i][j];
  int T;
  cin >> T;
  bool ck=0;
  while(T--) {
    int x,y,z;
    cin >> x >> y >> z;
    if(ck) {
      if(T==1) {
        rep(i,n) {
          rep(j,m) {
            if(j) cout << " ";
            cout << z;
          }
          ln;
        }
      } else continue;
    }
    x--,y--;
    if(a[x][y]==z) continue;
    int d[n][m];
    rep(i,n)rep(j,m)d[i][j]=MAX;
    d[x][y]=0;
    a[x][y]=z;
    queue<P> que;
    que.push(P(x,y));
    while(!que.empty()) {
      P p=que.front();que.pop();
      int nx=p.F,ny=p.S;
      rep(i,4) {
        int xx=nx+dx[i],yy=ny+dy[i];
        if(!check(n,m,xx,yy)) continue;
        int c=d[nx][ny];
        if((z==a[xx][yy]&&c%2==0)||(z!=a[xx][yy]&&c%2==1)) c++;
        if(c>1||d[xx][yy]<=c) continue;
        d[xx][yy]=c;
        a[xx][yy]=z;
        que.push(P(xx,yy));
      }
    }
    bool f=1;
    rep(i,n)rep(j,m){
      d[i][j]=MAX;
      if(a[i][j]!=z) f=0;
    }
    if(f) ck=1;
  }
  rep(i,n)PR(a[i],m);
}

int main() {
  ios::sync_with_stdio(0);cin.tie(0);
  Main();return 0;
}