import java.io.InputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.ArrayDeque;
import java.util.Comparator;
import java.util.Deque;
import java.util.HashSet;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
import java.math.BigInteger;

public class Main{

static PrintWriter out;
static InputReader ir;
static final int[] dx={-1,0,1,0},dy={0,-1,0,1};
static boolean[][] visited;
static int h,w;

static void solve(){
 h=ir.nextInt();
 w=ir.nextInt();
 int[][] a=new int[h][];
 visited=new boolean[h][w];
 for(int i=0;i<h;i++) a[i]=ir.nextIntArray(w);
 int q=ir.nextInt();
 while(q-->0){
  int r=ir.nextInt();
  int c=ir.nextInt();
  int x=ir.nextInt();
  bfs(a,r,c,x);
 }
 for(int i=0;i<h;i++){
  for(int j=0;j<w;j++){
   out.print(a[i][j]+((j==w-1)?"\n":" "));
  }
 }
}

public static void bfs(int[][] a,int r,int c,int x){
 for(int i=0;i<h;i++) Arrays.fill(visited[i],false);
 HashSet<int[]> set=new HashSet<>();
 Deque<int[]>  que=new ArrayDeque<>();
 que.addFirst(new int[]{r,c});
 while(!que.isEmpty()){
  int[] p=que.poll();
  visited[p[0]][p[1]]=true;
  for(int i=0;i<4;i++){
   int nx=p[0]+dx[i];
   int ny=p[1]+dy[i];
   if(nx>=0&&ny>=0&&nx<h&&ny<w&&a[p[0]][p[1]]==a[nx][ny]&&!visited[nx][ny]) que.addFirst(new int[]{nx,ny});
  }
 }
 for(int[] p : set){
  a[p[0]][p[1]]=x;
 }
}

public static void main(String[] args) throws Exception{
 ir=new InputReader(System.in);
 out=new PrintWriter(System.out);
 solve();
 out.flush();
}

static class InputReader {
 private InputStream in;
 private byte[] buffer=new byte[1024];
 private int curbuf;
 private int lenbuf;

 public InputReader(InputStream in) {this.in=in; this.curbuf=this.lenbuf=0;}
 
 public boolean hasNextByte() {
  if(curbuf>=lenbuf){
   curbuf= 0;
   try{
    lenbuf=in.read(buffer);
   }catch(IOException e) {
    throw new InputMismatchException();
   }
   if(lenbuf<=0) return false;
  }
  return true;
 }

 private int readByte(){if(hasNextByte()) return buffer[curbuf++]; else return -1;}
 
 private boolean isSpaceChar(int c){return !(c>=33&&c<=126);}
 
 private void skip(){while(hasNextByte()&&isSpaceChar(buffer[curbuf])) curbuf++;}
 
 public boolean hasNext(){skip(); return hasNextByte();}
 
 public String next(){
  if(!hasNext()) throw new NoSuchElementException();
  StringBuilder sb=new StringBuilder();
  int b=readByte();
  while(!isSpaceChar(b)){
   sb.appendCodePoint(b);
   b=readByte();
  }
  return sb.toString();
 }
 
 public int nextInt() {
  if(!hasNext()) throw new NoSuchElementException();
  int c=readByte();
  while (isSpaceChar(c)) c=readByte();
  boolean minus=false;
  if (c=='-') {
   minus=true;
   c=readByte();
  }
  int res=0;
  do{
   if(c<'0'||c>'9') throw new InputMismatchException();
   res=res*10+c-'0';
   c=readByte();
  }while(!isSpaceChar(c));
  return (minus)?-res:res;
 }
 
 public long nextLong() {
  if(!hasNext()) throw new NoSuchElementException();
  int c=readByte();
  while (isSpaceChar(c)) c=readByte();
  boolean minus=false;
  if (c=='-') {
   minus=true;
   c=readByte();
  }
  long res = 0;
  do{
   if(c<'0'||c>'9') throw new InputMismatchException();
   res=res*10+c-'0';
   c=readByte();
  }while(!isSpaceChar(c));
  return (minus)?-res:res;
 }

 public double nextDouble(){return Double.parseDouble(next());}

 public BigInteger nextBigInteger(){return new BigInteger(next());}

 public int[] nextIntArray(int n){
  int[] a=new int[n];
  for(int i=0;i<n;i++) a[i]=nextInt();
  return a;
 }

 public long[] nextLongArray(int n){
  long[] a=new long[n];
  for(int i=0;i<n;i++) a[i]=nextLong();
  return a;
 }

 public char[][] nextCharMap(int n,int m){
  char[][] map=new char[n][m];
  for(int i=0;i<n;i++) map[i]=next().toCharArray();
  return map;
 }
}
}