Artem is building a new robot. He has a matrix a consisting of n rows and m columns. The cell located on the i-th row from the top and the j-th column from the left has a value a_{i,j} written in it. 

If two adjacent cells contain the same value, the robot will break. A matrix is called good if no two adjacent cells contain the same value, where two cells are called adjacent if they share a side. 

Artem wants to increment the values in some cells by one to make a good.

More formally, find a good matrix b that satisfies the following condition — 

  * For all valid (i,j), either b_{i,j} = a_{i,j} or b_{i,j} = a_{i,j}+1. 



For the constraints of this problem, it can be shown that such a matrix b always exists. If there are several such tables, you can output any of them. Please note that you do not have to minimize the number of increments.

Input

Each test contains multiple test cases. The first line contains the number of test cases t (1 ≤ t ≤ 10). Description of the test cases follows.

The first line of each test case contains two integers n, m (1 ≤ n ≤ 100, 1 ≤ m ≤ 100) — the number of rows and columns, respectively.

The following n lines each contain m integers. The j-th integer in the i-th line is a_{i,j} (1 ≤ a_{i,j} ≤ 10^9).

Output

For each case, output n lines each containing m integers. The j-th integer in the i-th line is b_{i,j}.

Example

Input


3
3 2
1 2
4 5
7 8
2 2
1 1
3 3
2 2
1 3
2 2


Output


1 2
5 6
7 8
2 1
4 3
2 4
3 2

Note

In all the cases, you can verify that no two adjacent cells have the same value and that b is the same as a with some values incremented by one. 
import java.io.*;
import java.util.*;
 
 
public class Main{
	public static Reader sc = new Reader();
	//public static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	static int[][] b;
	static int[][] w;
	static int[][] g;
	static int[][] v;
	static class Pair{
		int r, c;
		public Pair(int x, int y) {
			r = x;
			c = y;
		}
	}
	static class Det implements Comparable<Det>{
		int val; 
		List<Pair> comp;
		public Det(int v, List<Pair> c) {
			val = v;
			comp = c;
		}
		@Override
		public int compareTo(Det o) {
			// TODO Auto-generated method stub
			return val-o.val;
		}
		public String toString() {
			return val + " ";
		}
	}
	static int n, m;
	static int fill;
	static void dfs(List<Pair> comp, int i, int j, int val) {
		if (v[i][j] > 0) return;
		if (g[i][j] != val) return;
		v[i][j] = fill;
		comp.add(new Pair(i,j));
		if (i != 0) {
			dfs(comp, i-1, j,val);
		}
		if (i != n-1) {
			dfs(comp, i+1, j,val);
		}
		if (j != 0) {
			dfs(comp, i, j-1,val);
		}
		if (j != m-1) {
			dfs(comp, i, j+1,val);
		}
		
	}
	public static void main(String[] args) throws IOException{
	
	int t = sc.nextInt();
	while (t-->0){
		n = sc.nextInt();
		m = sc.nextInt();
		// Get a bunch of components, try checkerboarding.
		g=  new int[n][m];
		b = new int[n][m];
		w = new int[n][m];
		for (int i = 0 ; i < n; i++) {
			for (int j = 0; j < m; j++) {
				g[i][j] = sc.nextInt();
				b[i][j] = (i + j) % 2;
				w[i][j] = (i+1+j)%2;
			}
		}
		List<Det> comp = new ArrayList<Det>();
		v  = new int[n][m];
		fill = 1;
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				if (v[i][j] == 0) {
					//System.out.println(g[i][j]);
					Det tt = new Det(g[i][j], new ArrayList<Pair>());
					dfs(tt.comp, i, j, g[i][j]);
					comp.add(tt);

					fill++;
				}
			}
		}
		Collections.sort(comp);
		//System.out.println(comp);
		//System.out.println(comp.size());
		for (Det a: comp) {
			boolean addB = true;
			for (Pair p: a.comp) {
				if (b[p.r][p.c] == 1) continue;
				int i = p.r;
				int j = p.c;
				if (i != 0) {
					
					if (v[i-1][j] != v[i][j] && g[i-1][j] == a.val) addB = false;
				}
				if (i != n-1) {
					if (v[i+1][j] != v[i][j] &&  g[i+1][j] == a.val) addB = false;

				}
				if (j != 0) {
					if (v[i][j] != v[i][j-1] && g[i][j-1] == a.val) addB = false;

				}
				if (j != m-1) {
					if (v[i][j] != v[i][j+1] && g[i][j+1] == a.val) addB = false;

				}
			}
			if (addB) {

				for (Pair p: a.comp) {
					g[p.r][p.c] += b[p.r][p.c];
				}
			}
			else {
				for (Pair p: a.comp) {
					g[p.r][p.c] += w[p.r][p.c];
				}
			}
		}
		for (int i =0; i < n; i++) {
			for (int j = 0 ; j < m; j++) {
				out.print(g[i][j] + " ");
			}
			out.println();
		}
	}
	 
	out.close();
   }
   static long ceil(long a, long b) {
		return (a+b-1)/b;
	}
  
   static long powMod(long base, long exp, long mod) {
	   if (base == 0 || base == 1) return base;
	   if (exp == 0) return 1;
	   if (exp == 1) return base % mod;
	   long R = powMod(base, exp/2, mod) % mod;
	   R *= R;
	   R %= mod;
	   if ((exp & 1) == 1) {
		   return base * R % mod;
	   }
	   else return R % mod;
   }
   
   static long pow(long base, long exp) {
	   if (base == 0 || base == 1) return base;
	   if (exp == 0) return 1;
	   if (exp == 1) return base;
	   long R = pow(base, exp/2);
	   if ((exp & 1) == 1) {
		   return R * R * base;
	   }
	   else return R * R;
   }
   

 
   static class Reader 
   { 
       final private int BUFFER_SIZE = 1 << 16; 
       private DataInputStream din; 
       private byte[] buffer; 
       private int bufferPointer, bytesRead; 

       public Reader() 
       { 
           din = new DataInputStream(System.in); 
           buffer = new byte[BUFFER_SIZE]; 
           bufferPointer = bytesRead = 0; 
       } 

       public Reader(String file_name) throws IOException 
       { 
           din = new DataInputStream(new FileInputStream(file_name)); 
           buffer = new byte[BUFFER_SIZE]; 
           bufferPointer = bytesRead = 0; 
       } 

       public String readLine() throws IOException 
       { 
           byte[] buf = new byte[64]; // line length 
           int cnt = 0, c;
           while ((c = read()) != -1) 
           { 
               if (c == '\n') 
               {
            	   break;
               }
               buf[cnt++] = (byte) c; 
           } 
           return new String(buf, 0, Integer.max(cnt-1, 0)); 
       } 

       public int nextInt() throws IOException 
       { 
           int ret = 0; 
           byte c = read(); 
           while (c <= ' ') 
               c = read(); 
           boolean neg = (c == '-'); 
           if (neg) 
               c = read(); 
           do
           { 
               ret = ret * 10 + c - '0'; 
           }  while ((c = read()) >= '0' && c <= '9'); 

           if (neg) 
               return -ret; 
           return ret; 
       } 

       public long nextLong() throws IOException 
       { 
           long ret = 0; 
           byte c = read(); 
           while (c <= ' ') 
               c = read(); 
           boolean neg = (c == '-'); 
           if (neg) 
               c = read(); 
           do { 
               ret = ret * 10 + c - '0'; 
           } 
           while ((c = read()) >= '0' && c <= '9'); 
           if (neg) 
               return -ret; 
           return ret; 
       } 

       public double nextDouble() throws IOException 
       { 
           double ret = 0, div = 1; 
           byte c = read(); 
           while (c <= ' ') 
               c = read(); 
           boolean neg = (c == '-'); 
           if (neg) 
               c = read(); 

           do { 
               ret = ret * 10 + c - '0'; 
           } 
           while ((c = read()) >= '0' && c <= '9'); 

           if (c == '.') 
           { 
               while ((c = read()) >= '0' && c <= '9') 
               { 
                   ret += (c - '0') / (div *= 10); 
               } 
           } 

           if (neg) 
               return -ret; 
           return ret; 
       } 

       private void fillBuffer() throws IOException 
       { 
           bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE); 
           if (bytesRead == -1) 
               buffer[0] = -1; 
       } 

       private byte read() throws IOException 
       { 
           if (bufferPointer == bytesRead) 
               fillBuffer(); 
           return buffer[bufferPointer++]; 
       } 

       public void close() throws IOException 
       { 
           if (din == null) 
               return; 
           din.close(); 
       } 
   }

	public static PrintWriter out = new PrintWriter (new BufferedOutputStream(System.out));
}











