package contest; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.ArrayList; import java.util.Arrays; import java.util.InputMismatchException; import java.util.List; public class Q769_2 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), m = ni(); int[][] a = new int[n][]; for(int i = 0;i < n;i++){ a[i] = na(m); } List> nes = new ArrayList<>(); for(int i = 0;i < n*m;i++)nes.add(new ArrayList()); DJSet ds = new DJSet(n*m); for(int i = 0;i < n;i++){ for(int j = 0;j < m-1;j++){ if(a[i][j] == a[i][j+1]){ ds.union(i*m+j, i*m+j+1); } } } for(int i = 0;i < n-1;i++){ for(int j = 0;j < m;j++){ if(a[i][j] == a[i+1][j]){ ds.union(i*m+j, (i+1)*m+j); } } } for(int i = 0;i < n;i++){ for(int j = 0;j < m-1;j++){ if(a[i][j] != a[i][j+1]){ nes.get(ds.root(i*m+j)).add(i*m+j<<1|0); nes.get(ds.root(i*m+j+1)).add(i*m+j<<1|0); } } } for(int i = 0;i < n-1;i++){ for(int j = 0;j < m;j++){ if(a[i][j] != a[i+1][j]){ nes.get(ds.root(i*m+j)).add(i*m+j<<1|1); nes.get(ds.root((i+1)*m+j)).add(i*m+j<<1|1); } } } for(int Q = ni();Q > 0;Q--){ int r = ni()-1, c = ni()-1, x = ni(); int root = ds.root(r*m+c); if(a[root/m][root%m] != x){ a[root/m][root%m] = x; List> mall = new ArrayList<>(); List merged = null; for(int e : nes.get(root)){ if((e&1) == 0){ int my = e>>>1, ot = (e>>>1)+1; if(!ds.equiv(my, ot)){ if(ds.root(my) != root){ List y = nes.get(ds.root(my)); if(merged == null || y.size() > merged.size()){ if(merged != null)mall.add(merged); merged = y; }else{ mall.add(y); } } if(ds.root(ot) != root){ List y = nes.get(ds.root(ot)); if(merged == null || y.size() > merged.size()){ if(merged != null)mall.add(merged); merged = y; }else{ mall.add(y); } } } ds.union(my, ot); }else{ int my = e>>>1, ot = (e>>>1)+m; if(!ds.equiv(my, ot)){ if(ds.root(my) != root){ List y = nes.get(ds.root(my)); if(merged == null || y.size() > merged.size()){ if(merged != null)mall.add(merged); merged = y; }else{ mall.add(y); } } if(ds.root(ot) != root){ List y = nes.get(ds.root(ot)); if(merged == null || y.size() > merged.size()){ if(merged != null)mall.add(merged); merged = y; }else{ mall.add(y); } } } ds.union(my, ot); } } root = ds.root(root); if(merged == null){ nes.set(root, new ArrayList()); }else{ for(List ma : mall)merged.addAll(ma); nes.set(root, merged); } } } for(int i = 0;i < n;i++){ for(int j = 0;j < m;j++){ if(j > 0)out.print(" "); int root = ds.root(i*m+j); out.print(a[root/m][root%m]); } out.println(); } } public static class DJSet { public int[] upper; public DJSet(int n) { upper = new int[n]; Arrays.fill(upper, -1); } public int root(int x) { return upper[x] < 0 ? x : (upper[x] = root(upper[x])); } public boolean equiv(int x, int y) { return root(x) == root(y); } public boolean union(int x, int y) { x = root(x); y = root(y); if (x != y) { if (upper[y] < upper[x]) { int d = x; x = y; y = d; } upper[x] += upper[y]; upper[y] = x; } return x == y; } public int count() { int ct = 0; for (int u : upper) if (u < 0) ct++; return ct; } } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); } public static void main(String[] args) throws Exception { new Q769_2().run(); } private byte[] inbuf = new byte[1024]; private int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }