#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <string.h>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <numeric>
#include <cctype>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rrep(i,n) for(int i = 1; i <= n; ++i)
#define drep(i,n) for(int i = n-1; i >= 0; --i)
#define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define df(x) int x = in()
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
inline int in() { int x; scanf("%d",&x); return x;}
inline void priv(vi a) { rep(i,sz(a)) printf("%d%c",a[i],i==sz(a)-1?'\n':' ');}

const int MX = 205, INF = 1000010000;
const ll LINF = 1000000000000000000ll;
const double eps = 1e-10;

// Union find
struct uf {
  vector<int> d;
  uf(){}
  uf(int mx):d(mx,-1){}
  int root(int x){
    if(d[x] < 0) return x;
    return d[x] = root(d[x]);
  }
  void unite(int x, int y){
    x = root(x); y = root(y);
    if(x == y) return;
    d[y] = x;
  }
};
//

int h, w;
int a[MX][MX];

const int di[] = {-1,0,1,0}, dj[] = {0,-1,0,1}; //^<v>
//const int di[] = {-1,0,1,-1,1,-1,0,1}, dj[] = {-1,-1,-1,0,0,1,1,1};
int dfs(int i, int j) {
  int c = a[i][j];
  a[i][j] = -1;
  int res = 1;
  rep(v,4) {
    int ni = i+di[v], nj = j+dj[v];
    if (ni<0||nj<0||ni>=h||nj>=w) continue;
    if (a[ni][nj] != c) continue;
    res += dfs(ni,nj);
  }
  return res;
}
void efs(int i, int j, int x) {
  a[i][j] = x;
  rep(v,4) {
    int ni = i+di[v], nj = j+dj[v];
    if (ni<0||nj<0||ni>=h||nj>=w) continue;
    if (a[ni][nj] != -1) continue;
    efs(ni,nj,x);
  }
}

int main() {
  scanf("%d%d",&h,&w);
  rep(i,h)rep(j,w) scanf("%d",&a[i][j]);
  int q;
  scanf("%d",&q);
  // uf t(h*w);
  // rep(i,h)rep(j,w) if (a[i][j]) t.d[i*w+j] = -2;
  int end = 0, col = 0;
  rep(qi,q) {
    int r, c, x;
    scanf("%d%d%d",&r,&c,&x);
    if (end) { col = x; continue; }
    --r; --c;
    if (x == a[r][c]) continue;
    int cnt = dfs(r,c);
    if (cnt == h*w) {
      end = 1;
      col = x;
      continue;
    }
    efs(r,c,x);
  }
  if (end) { rep(i,h)rep(j,w) a[i][j] = col;}
  rep(i,h) {
    vi x;
    rep(j,w) x.pb(a[i][j]);
    priv(x);
  }
  return 0;
}