import java.io.InputStream; import java.io.IOException; import java.io.PrintWriter; import java.util.ArrayList; import java.util.Arrays; import java.util.ArrayDeque; import java.util.Comparator; import java.util.Deque; import java.util.HashSet; import java.util.InputMismatchException; import java.util.NoSuchElementException; import java.math.BigInteger; public class Main{ static PrintWriter out; static InputReader ir; static final int[] dx={-1,0,1,0},dy={0,-1,0,1}; static boolean[][] visited; static hs[][] set=new hs[2][2]; static int h,w; static void solve(){ h=ir.nextInt(); w=ir.nextInt(); int[][] a=new int[h][]; visited=new boolean[h][w]; for(int i=0;i<2;i++){ for(int j=0;j<2;j++){ set[i][j]=new hs(); } } for(int i=0;i0){ int r=ir.nextInt()-1; int c=ir.nextInt()-1; int x=ir.nextInt(); bfs(a,r,c,x,q%2); } for(int i=0;i<2;i++){ for(int[] p : set[0][i]){ a[p[0]][p[1]]=i; } } for(int i=0;i que=new ArrayDeque<>(); que.addFirst(new int[]{r,c}); while(!que.isEmpty()){ int[] p=que.pollFirst(); for(int i=0;i<2;i++){ if(set[t^1][i].contains(p)){ for(int[] pp : set[t^1][i]){ visited[pp[0]][pp[1]]=true; set[t][x].add(pp); } break; } } set[t][x].add(p); visited[p[0]][p[1]]=true; for(int i=0;i<4;i++){ int nx=p[0]+dx[i]; int ny=p[1]+dy[i]; if(nx>=0&&ny>=0&&nx{} public static void main(String[] args) throws Exception{ ir=new InputReader(System.in); out=new PrintWriter(System.out); solve(); out.flush(); } static class InputReader { private InputStream in; private byte[] buffer=new byte[1024]; private int curbuf; private int lenbuf; public InputReader(InputStream in) {this.in=in; this.curbuf=this.lenbuf=0;} public boolean hasNextByte() { if(curbuf>=lenbuf){ curbuf= 0; try{ lenbuf=in.read(buffer); }catch(IOException e) { throw new InputMismatchException(); } if(lenbuf<=0) return false; } return true; } private int readByte(){if(hasNextByte()) return buffer[curbuf++]; else return -1;} private boolean isSpaceChar(int c){return !(c>=33&&c<=126);} private void skip(){while(hasNextByte()&&isSpaceChar(buffer[curbuf])) curbuf++;} public boolean hasNext(){skip(); return hasNextByte();} public String next(){ if(!hasNext()) throw new NoSuchElementException(); StringBuilder sb=new StringBuilder(); int b=readByte(); while(!isSpaceChar(b)){ sb.appendCodePoint(b); b=readByte(); } return sb.toString(); } public int nextInt() { if(!hasNext()) throw new NoSuchElementException(); int c=readByte(); while (isSpaceChar(c)) c=readByte(); boolean minus=false; if (c=='-') { minus=true; c=readByte(); } int res=0; do{ if(c<'0'||c>'9') throw new InputMismatchException(); res=res*10+c-'0'; c=readByte(); }while(!isSpaceChar(c)); return (minus)?-res:res; } public long nextLong() { if(!hasNext()) throw new NoSuchElementException(); int c=readByte(); while (isSpaceChar(c)) c=readByte(); boolean minus=false; if (c=='-') { minus=true; c=readByte(); } long res = 0; do{ if(c<'0'||c>'9') throw new InputMismatchException(); res=res*10+c-'0'; c=readByte(); }while(!isSpaceChar(c)); return (minus)?-res:res; } public double nextDouble(){return Double.parseDouble(next());} public BigInteger nextBigInteger(){return new BigInteger(next());} public int[] nextIntArray(int n){ int[] a=new int[n]; for(int i=0;i