#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>
#include <numeric>
#include <bitset>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()

struct UnionFind
{
  vector<int> rank;
  vector<int> rid;

  UnionFind(int n) {
    rank.resize(n);
    rid.assign(n, -1);
  }

  void unite(int u, int v) {
    u = root(u), v = root(v);
    if(u == v) { return ; }
    if(rank[u] < rank[v]) {
      rid[u] = v;
    }
    else {
      rid[v] = u;
      if(rank[u] == rank[v]) {
        rank[u]++;
      }
    }
  }

  bool same(int u, int v) {
    return root(u) == root(v);
  }

  inline int root(int x) {
    if(rid[x] < 0) return x;
    else return rid[x] = root(rid[x]);
  }

  inline int operator[](int x) { return root(x); }
};

int dx[4] = {-1,0,1,0};
int dy[4] = {0,-1,0,1};

int H, W;
int A[201][201];
int Q;
bool rootCol[200*200+1];
vector<int> outers[200*200+1]; // []はroot

bool inrange(int y, int x) {
  return 0<=y&&y<H && 0<=x&&x<W;
}

typedef pair<int, int> pii;

inline int chpos(int y, int x) { return y*W+x; }
inline pii coord(int p) { return std::move(make_pair(p/W, p%W)); }

#define DEBUG debug(uf);
void debug(UnionFind& uf) {
cout << "v check ----------\n";
  rep(i, H) {
    rep(j, W) {
      if(j) cout << " ";
      cout << rootCol[uf.root(chpos(i, j))];
    }
    cout << endl;
  }
cout << "^ check ----------\n";
}

void merge_set(set<int>& a, set<int>& b) {
  if (a.size() < b.size()) swap(a, b);
  if(b.empty()) { return; }
  a.insert(b.begin(), b.end());
  b.clear();
}

int main() {

  cin >> H >> W;

  rep(i, H) rep(j, W) {
    cin >> A[i][j];
    rootCol[chpos(i, j)] = A[i][j];
  }

  UnionFind uf(H * W + 1);

  rep(i, H) rep(j, W) rep(k, 4) {
    int ni = i+dy[k], nj = j+dx[k];
    if(!inrange(ni, nj)) { continue; }
    if(A[i][j] == A[ni][nj]) {
      uf.unite(chpos(i, j), chpos(ni, nj));
      rootCol[uf.root(chpos(i, j))] = A[i][j];
    }
  }

  rep(i, H) rep(j, W) rep(k, 4) {
    int ni = i+dy[k], nj = j+dx[k];
    if(!inrange(ni, nj)) { continue; }
    if(A[i][j] != A[ni][nj]) {
      outers[uf[chpos(i, j)]].push_back(uf[chpos(ni, nj)]);
      int rt = uf[chpos(i, j)];
      sort(all(outers[rt]));
      outers[rt].erase(unique(all(outers[rt])), outers[rt].end());
    }
  }

  cin >> Q;
  rep(_, Q) {
    int r, c, x;
    cin >> r >> c >> x; r--, c--;
//    #define RawPos uf.root(chpos(r, c))
    int const RawPos = uf.root(chpos(r, c));
/*
    cout << "rc outers " << r+1 << ", " << c+1 << endl;
    for(auto& e: outers[RawPos]) {
      cout << coord(e).first + 1 << ", " << coord(e).second + 1 << endl;
    }cout << endl;
//*/
    if(rootCol[RawPos] != x) {
//      refCol = x;
      vector<int> os; for(auto& e: outers[RawPos]) os.push_back(e);
      for(auto& e: os) {
        if(uf.same(e, RawPos)) { continue; }
//        if(e != uf[e]) { assert(outers[e].empty()); }
        if(rootCol[uf[e]] != rootCol[RawPos]) {
//          merge_set(outers[RawPos], outers[uf[e]]);
          copy(all(outers[uf[e]]), back_inserter(outers[RawPos]));
//          outers[uf[e]].clear();
          uf.unite(e, RawPos);
        }
      }
      if(RawPos != uf.root(RawPos)) {
  //      assert(outers[uf.root(RawPos)].empty());
        swap(outers[uf.root(RawPos)], outers[RawPos]);
      }
      sort(all(outers[uf[RawPos]]));
      outers[uf[RawPos]].erase(unique(all(outers[uf[RawPos]])), outers[uf[RawPos]].end());
      rootCol[uf.root(RawPos)] = x;
    }

//    cout << "query: (" << r+1 << ", " << c+1 << ") " << x << "\n";
//    DEBUG


  /*
      cout << "rc outers " << r+1 << ", " << c+1 << " (" << coord(uf[RawPos]).first << ", " << coord(uf[RawPos]).second << ")\n";
      for(auto& e: outers[uf[RawPos]]) {
        cout << coord(e).first + 1 << ", " << coord(e).second + 1 << endl;
      }cout << endl << "------------------------------\n\n";
  //*/
  }

  rep(i, H) {
    rep(j, W) {
      if(j) cout << " ";
      cout << rootCol[uf.root(chpos(i, j))];
    }
    cout << endl;
  }


  return 0;
}