#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef unsigned long long ull; typedef vector veci; typedef vector vecs; template using Hash=unordered_map; #define REP(i, a, n) for(ll i = a; i < n; i++) #define RREP(i, a, n) for(ll i = n-1; i >= a; i--) #define rep(i, n) REP(i, 0, n) #define rrep(i, n) RREP(i, 0, n) #define MD 1000000007 template T read(){T a;cin >> a;return a;} template void read(T& a){cin >> a;} template void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}} template void write(T a){cout << a << endl;} template void writes(vector a, const char* c = " "){cout << a[0];for(int i = 1; i < (int)a.size(); i++)cout << c << a[i];cout << endl;;} void write(double a){cout << fixed << setprecision(12) << a << endl;} void write(long double a){cout << fixed << setprecision(12) << a << endl;} template void warr(T a, int n, const char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;} void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}} void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}} ll gcd(ll a, ll b){while(true){ll k = a % b;if(k == 0)return b;a = b;b = k;}} ll comb(ll n, ll m){ll p=1;m=min(m,n-m);for(ll i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;} struct Info{ Info(int i,int x,int y,int c): color(c),id(i),sx(x),sy(y),n(1){} int color; int id; int sx,sy; set st; int n; }; int h,w; int a[200][200]; Info* p[200][200]={0}; int dx[]={1,0,-1,0}; int dy[]={0,1,0,-1}; typedef pair pai; void paint(int sx,int sy,Info* pt,int select){ queue q; q.push(pai(sx,sy)); Info* ti=p[sy][sx]; int at=a[sy][sx]; bool vis[200][200]={0}; while(!q.empty()){ pai tp=q.front(); q.pop(); p[tp.second][tp.first]=pt; vis[tp.second][tp.first]=true; rep(i,4){ int cx=tp.first+dx[i]; int cy=tp.second+dy[i]; if(cx<0||cx>=w||cy<0||cy>=h)continue; if(select==0){ if(!vis[cy][cx]&&a[cy][cx]==at){ q.push(pai(cx,cy)); } } else if(select==1){ if(!vis[cy][cx]&&p[cy][cx]==ti){ q.push(pai(cx,cy)); } } else{ if(p[cy][cx]==ti&&!vis[cy][cx]){ ti->n++; q.push(pai(cx,cy)); } else if(p[cy][cx]!=ti){ ti->st.insert(p[cy][cx]->id); } } } } } int main(void) { cin>>h>>w; rep(i,h)rep(j,w)cin>>a[i][j]; vector pif; int id=0; rep(i,h)rep(j,w) { if(p[i][j]!=NULL)continue; Info* pt=new Info(id++,j,i,a[i][j]); paint(j,i,pt,0); pif.push_back(pt); } rep(i,id){ paint(pif[i]->sx,pif[i]->sy,pif[i],2); //cout<n<>q; rep(i,q){ int r,c,xi; cin>>r>>c>>xi; r--;c--; Info* cp=p[r][c]; if(cp->color==xi)continue; cp->color=xi; set st; int maxn=cp->n; int maxi=cp->id; int sumn=maxn; for(auto at1:cp->st){ if(pif[at1]->n>maxn){ maxn=pif[at1]->n; maxi=at1; } sumn+=pif[at1]->n; for(auto at2:pif[at1]->st){ st.insert(at2); } } st.erase(maxi); for(auto at:cp->st){ if(maxi==at)continue; paint(pif[at]->sx,pif[at]->sy,pif[maxi],1); } if(maxi!=cp->id) paint(cp->sx,cp->sy,pif[maxi],1); pif[maxi]->n=sumn; pif[maxi]->st=st; } rep(i,h){ cout<color; REP(j,1,w){ cout<<" "<color; } cout<