#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;
int H,W;
char board[300][300];

struct A{
  vector <pair <int,int> > bounds;
  set <pair <int,int> > adj;
  pair <int,int> root;
  int color;
  A(){};
  A(int color_, const vector <pair <int,int> > bounds_, const pair <int,int> root_){
    color = color_;
    bounds = bounds_;
    root = root_;
  }
};

map <pair <int,int>, A> areas;
bool used[300][300];
pair <int,int> root[300][300];
int myrank[300][300];
inline pair <int,int> find(pair <int,int> a){
  if (root[a.fir][a.sec] == a) {
    return a;
  }else{
    return root[a.fir][a.sec] = find(root[a.fir][a.sec]);
  }
}
inline void unite(pair <int,int> x, pair <int,int> y) {
  x = find(x);
  y = find(y);
  if (x == y) {
    return;
  }
  if (myrank[x.fir][x.sec] < myrank[y.fir][y.sec]) {
    root[x.fir][x.sec] = y;
  }else{
    root[y.fir][y.sec] = x;
    if (myrank[x.fir][x.sec] == myrank[y.fir][y.sec]) {
      myrank[x.fir][x.sec] += 1;
    }
  }
}
inline bool same(pair <int,int> x, pair <int,int> y) {
  return find(x) == find(y);
}

vector <pair <int,int> > area;
int dx[] = {-1,0,0,1};
int dy[] = {0,1,-1,0};
inline bool OK(int x , int y){
  return 0 <= x && x < H && 0 <= y && y < W;
}
inline void dfs(int i, int j, pair <int,int> myroot){
  if (used[i][j]) {
    return;
  }
  used[i][j] = true;
  root[i][j] = myroot;
  area.pb(mp(i,j));
  rep(k,4){
    int nx = i + dx[k], ny = j + dy[k];
    if (OK(nx,ny) && board[i][j] == board[nx][ny]) {
      dfs(nx,ny,myroot);
    }
  }
}
inline vector <pair <int,int> > build_bound(){
  vector <pair <int,int > > bounds;
  for (auto a : area){
    rep(i,4){
      int ax = a.fir + dx[i];
      int ay = a.sec + dy[i];
      if (OK(ax, ay)) {
        if (!used[ax][ay] || root[ax][ay] != root[a.fir][a.sec]) {
          bounds.pb(a);
          break;
        }
      }else{
        bounds.pb(a);
        break;
      }
    }
  }
  return bounds;
}
inline void build_adj(){
  for (auto &a : areas) {
    for (auto &b : a.sec.bounds){
      rep(i,4){
        int nx = b.fir + dx[i];
        int ny = b.sec + dy[i];
        if (OK(nx,ny) && root[nx][ny] != root[b.fir][b.sec]) {
          a.sec.adj.insert(root[nx][ny]);
        }
      }
    }
  }
}
inline void build(){
  rep(i,H){
    rep(j,W){
      if (!used[i][j]) {
        dfs(i,j,mp(i,j));
        areas[mp(i,j)] = A(board[i][j] - '0', build_bound(), mp(i,j));
        area.clear();
      }
    }
  }
  build_adj();
}

void print(){
  rep(i,H){
    rep(j,W){
      if (j) {
        cout << ' ';
      }
      auto myroot = find(root[i][j]);
      char c = '0' + areas[myroot].color;
      cout << c;
    }
    cout << endl;
  }
  rep(i,H){
    rep(j,W){
      //DEBUG3(i,j,root[i][j]);
      auto myroot = find(root[i][j]);
      DEBUG3(i,j, myroot);
    }
  }
  DEBUG2(H,W);
}

void paint(int R,int C, int X){
  auto myroot = find(root[R][C]);
  auto& cur = areas[myroot];
  if (cur.color == X) {
    return;
  }
  
  set <pair <int,int> > new_adj;
  for (auto &a : cur.adj){
    //merge
    auto adj_root = find(a);
    for (auto &b : areas[adj_root].adj) {
      new_adj.insert(b);
    }
    unite(adj_root, myroot);
  }
  for (auto it = new_adj.begin(); it != new_adj.end();){
    if (same(*it, myroot)) {
      new_adj.erase(it++);
    }else{
      it++;
    }
  }
  myroot = find(root[R][C]);
  areas[myroot].adj = new_adj;
  areas[myroot].color = X;
  //print();
}

int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cin >> H >> W;
  rep(i,H){
    rep(j,W){
      cin >> board[i][j];
    }
  }
  build();
  int Q;
  cin >> Q;
  rep(i,Q){
    int R,C,X;
    cin >> R >> C >> X;
    R--;C--;
    paint(R,C,X);
  }
 
  rep(i,H){
    rep(j,W){
      if (j) cout << ' ';
      auto myroot = find(root[i][j]);
      char c = areas[myroot].color + '0';
      cout << c;
    }
    cout << endl;
  }
  return 0;
}