#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#ifdef _MSC_VER
#include "bits\stdc++.h"
#else
#include <bits/stdc++.h>
#endif
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <list>
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
// #define rep(i,n) REP(i,1,n)
#define ll long long
#define ull unsigned ll
typedef long double ld;
#define SQR(X)  ( (X)*(X) )
#define CUBE(X) ( (X)*(X)*(X) )

// #define int ll

using namespace std;


bool test = 0;
/* ここからが本編 */
/* pow(x,n)はx^nを返すよ！ */
static int A[200][200];
int H,W;
int target_color;
int next_color;
void print_map()
{
  int i,j;
  if(test) puts("---map---");
  for(i=0;i<H;i++) {
    printf("%d",A[i][0]);
    for(j=1;j<W;j++) {
      printf(" %d",A[i][j]);
    }
    puts("");
  }
  if(test) puts("---------");
}

struct Point{
  int R,C;
};

int draw(int R, int C) {
  int i,j;
  queue<Point> q;
  Point start = {R,C};
  int dR[] = { 0, 0,-1, 1};
  int dC[] = { 1,-1, 0, 0};
  int cnt = 0;
  static bool visited[200][205];
  q.push(start);
  while( q.size() ) {
    Point now = q.front(); q.pop();
    visited[now.R][now.C] = true;
    cnt++;
    if(test) {
      printf("A[%d][%d] = %d ",now.R,now.C,A[R][C]);
      printf("target_color = %d\n",target_color);
      printf("R = %d C = %d\n",now.R,now.C);
    }

    A[now.R][now.C] = next_color;
    rep(i,4) {
      Point next;
      next.R = now.R+dR[i];
      next.C = now.C+dC[i];
      if(next.R < 0 || H <= next.R) continue; 
      else if(next.C < 0 || W <= next.C) continue;
      else if( visited[next.R][next.C] ) continue;
      else if(A[next.R][next.C] == target_color) {
        q.push(next);
      }
    }
  }
  return cnt;
}
int main(void)
{
  int i,j,k,l;
  int Q;
  scanf("%d",&H);
  scanf("%d",&W);
  for(i=0;i<H;i++) {
    for(j=0;j<W;j++) {
      scanf("%d",&A[i][j]);
    }
  }
  scanf("%d",&Q);
  int R,C,X;
  bool all_draw = false;
  for(i=0;i<Q;i++) {
    scanf("%d %d %d",&R,&C,&X);
    R--;C--;
    int a = 0;
    if(A[R][C] != X) {
      target_color = A[R][C]; next_color = X;
      a = draw(R,C);
      if(test) print_map();
    }
    if(a == H*W) {
      all_draw = true;
      break;
    }
  }
  for(;i<Q;i++) {
    scanf("%d %d %d",&R,&C,&X);
  }
  if(all_draw) {
    rep(i,H) rep(j,W) A[i][j] = X;
  }
  print_map();
  return 0;
}