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. 
//package CodeForces;

import java.io.*;
import java.util.*;
import javafx.util.Pair;

public class Main {

    public static MyScanner sc = new MyScanner();
    public static int MOD = 1000000007;
    // __builtin_popcountll(n) <-- c++ // binary count(1) ex. 8 --> 0100 --> 1
    HashSet<Integer> set = new HashSet<>();
    HashMap<Integer, Integer> map = new HashMap<>();
    Random r = new Random();
    ArrayList<Integer> l = new ArrayList<>();
    public static int[][] dp;

    /* ********************************* main ********************************* */
    public static void main(String[] args) {
        int t = 1;
        t = sc.nextInt();
        while(t-->0){
            int n = sc.nextInt();
            int m = sc.nextInt();
            int[][] a = new int[n+1][m+1];
            for (int i = 0; i < n; i++) 
                for (int j = 0; j < m; j++) 
                    a[i][j] = sc.nextInt();
            for (int i = 0; i < n; i++) 
                for (int j = 0; j < m; j++)
                    if(a[i][j] == a[i+1][j] || a[i][j] == a[i][j+1])
                        a[i][j]++;
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) 
                    System.out.print(a[i][j] + " ");
                System.out.println("");
            }
        }
    }
    /* ********************************* End ********************************* */
    
    public static void reverse(int[] a, int le){
        if(le == a.length/2) return;
        int temp = a[le];
        a[le] = a[a.length - le - 1];
        a[a.length - le - 1] = temp;
        reverse(a, --le);
    }
    
    public static int gcdEuclids(int m, int n){
        int r = m % n;
        while (r != 0) {
            m = n;
            n = r;
            r = m % n;
        }
        return n;
    }

    public static int gcd(int m, int n){
        return n != 0 ? gcd(n, m%n) : n;
    }
    
    public static int BinarySearch(int[] a, int v, int f, int l){
        int pos = -1;
        if(f <= l){
            int mid = (f + l)/2;
            if(a[mid] == v)
                pos = mid;
            else if(v < a[mid])
                pos = BinarySearch(a, v, f, mid - 1);
            else if(v > a[mid])
                pos = BinarySearch(a, v, mid + 1, l);
        }
        return pos;
    }
    
    public static ArrayList<Integer> factorize(Long n){
        HashSet<Integer> set = new HashSet<>();
        while(n%2 == 0){
            set.add(2);
            n /= 2;
        }
        for (int i = 3; i <= Math.sqrt(n); i = i + 2) {
            while (n % i == 0) {
                set.add(i);
                n /= i;
            }
        }
        ArrayList<Integer> l = new ArrayList<>(set);
        return l;
    }
    
    public static class MyScanner {

        BufferedReader br;
        StringTokenizer st;

        public MyScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

    public static class MyPair {

        int x;
        int y;

        public MyPair(int x, int y) {
            this.x = x;
            this.y = y;
        }

        public String toString() {
            return "[" + x  + ", " + y + "]";
        }
        
    }

    public static int Fibonacci(int n) {
        int[] a = new int[n + 1];
        a[0] = 0;
        a[1] = 1;
        for (int i = 2; i < a.length; i++) {
            a[i] = a[i - 1] + a[i - 2];
        }
        return a[n];
    }

    public static boolean isprime(int n) {
        for (int i = 2; i * i <= n; i++) {
            if (n % i == 0) {
                return false;
            }
        }
        return true;
    }

    public static int[] addarr(int[] a, int n) {
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }
        return a;
    }

    public static long factt(int n) {
        if (n == 0) {
            return 1;
        }
        return n * factt(n - 1);
    }

    public static long sumDigit(long n) {
        int a = 0;
        while (n != 0) {
            a += n % 10;
            n /= 10;
        }
        return a;
    }

    public static long pow(long n, long p) {
        return p == 0 ? 1 : n * pow(n, p - 1);
    }

    public static long fastpow(long v, long p) {
        if (p == 0) {
            return 1;
        }
        if (p == 1) {
            return v;
        }
        long ans = fastpow(v, p / 2);
        if (p % 2 == 1) {
            return ans * ans * v;
        } else {
            return ans * ans;
        }
    }

    public static int LCS(String s1, String s2, int i, int j) {
//        String s1 = sc.next();
//        String s2 = sc.next();
//        dp = new int[s1.length()][s2.length()];
//        System.out.println(LCS(s1, s2, s1.length()-1, s2.length()-1));
        if (i == -1 || j == -1) {
            return 0;
        } else if (dp[i][j] != 0) {
            return dp[i][j];
        } else if (s1.charAt(i) == s2.charAt(j)) {
            return dp[i][j] = 1 + LCS(s1, s2, i - 1, j - 1);
        } else {
            return dp[i][j] = Math.max(LCS(s1, s2, i - 1, j), LCS(s1, s2, i, j - 1));
        }
    }

}