CF1438C.Engineer Artem

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.

阿尔捷姆正在制造一个新机器人。他有一个由 $n$ 行和 $m$ 列组成的矩阵 $a$。位于从上往下第 $i$ 行、从左往右第 $j$ 列的单元格中写有数值 $a_{i,j}$。

如果两个相邻单元格包含相同的值，机器人就会损坏。若矩阵中不存在两个相邻单元格具有相同值，则称该矩阵为好矩阵；这里，若两个单元格共享一条边，则称它们为相邻。

阿尔捷姆希望通过对某些单元格的值加 $1$，使得矩阵 $a$ 变为一个好矩阵。

更准确地说，请找出一个好矩阵 $b$，满足以下条件：

• 对所有合法的 $(i,j)$，均有 $b_{i,j} = a_{i,j}$ 或 $b_{i,j} = a_{i,j}+1$。

在本题的约束条件下，可以证明这样的矩阵 $b$ 总是存在的。若存在多个满足条件的矩阵，输出任意一个即可。请注意，你不必最小化加 $1$ 的次数。

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

The first line of each test case contains two integers $n, m$ ($1 \le n \le 100$, $1 \le m \le 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 \leq a_{i,j} \leq 10^9$).

每个测试包含多个测试用例。第一行包含测试用例的数量 $t$（$1 \le t \le 10$）。随后是测试用例的描述。

每个测试用例的第一行包含两个整数 $n, m$（$1 \le n \le 100$，$1 \le m \le 100$）—— 分别表示行数和列数。

接下来的 $n$ 行，每行包含 $m$ 个整数。第 $i$ 行中的第 $j$ 个整数为 $a_{i,j}$（$1 \leq a_{i,j} \leq 10^9$）。

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

对于每组测试数据，输出 $n$ 行，每行包含 $m$ 个整数。第 $i$ 行的第 $j$ 个整数为 $b_{i,j}$。

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.

在所有情况下，您都可以验证：没有两个相邻的单元格具有相同的值，且 $b$ 与 $a$ 相同，只是其中某些值增加了 $1$。