import java.util.*;
import java.util.Map.Entry;
import java.math.*;
import java.awt.geom.*;
import java.io.*;
      
      
public class Main {	

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int h = sc.nextInt();
		int w = sc.nextInt();
		char[][] map = new char[h][w];
		for(int i = 0; i < h; i++) {
			for(int j = 0; j < w; j++) {
				map[i][j] = sc.next().charAt(0);
			}
		}
		int[][] color = new int[h][w];
		int id = 0;
		for(int i = 0; i < h; i++) {
			for(int j = 0; j < w; j++) {
				color[i][j] = id++;
			}
		}
		for(int i = 0; i < h; i++) {
			for(int j = 0; j < w; j++) {
				dfs(i,j,map,color,i,j,new boolean[h][w]);
			}
		}
		int q = sc.nextInt();
		for(int i = 0; i < q; i++) {
			int r = sc.nextInt()-1;
			int c = sc.nextInt()-1;
			char x = sc.next().charAt(0);
			
			int target = color[r][c];
			
			for(int j = 0; j < h; j++) {
				for(int k = 0; k < w; k++) {
					if(color[j][k] == target)
					map[j][k] = x;
				}
			}
			dfs(r,c,map,color,r,c,new boolean[h][w]);
		}
		for(int i = 0; i < h; i++) {
			System.out.print(map[i][0]);
			for(int j = 1; j < w; j++) {
				System.out.print(" " + map[i][j]);
			}
			System.out.println();
		}
	}
	static int[] vx = {0,1,0,-1};
	static int[] vy = {1,0,-1,0};
	static void dfs(int a, int b, char[][] MAP, int[][] COLOR, int oa, int ob, boolean[][] al) {
		if(a < 0 || b < 0 || a >= MAP.length || b >= MAP[a].length || MAP[a][b] != MAP[oa][ob] || al[a][b]) return;
		COLOR[a][b] = COLOR[oa][ob];
		al[a][b] = true;
		for(int i = 0; i < 4; i++) {
			int ty = vy[i] + a;
			int tx = vx[i] + b;
			if(ty < 0 || tx < 0 || ty >= MAP.length || tx >= MAP[tx].length || MAP[ty][tx] != MAP[oa][ob] || al[ty][tx]) continue;
			dfs(ty,tx,MAP,COLOR,oa,ob,al);
		}
	}
	
	
}