CF1838C.No Prime Differences

You are given integers $n$ and $m$. Fill an $n$ by $m$ grid with the integers $1$ through $n\cdot m$, in such a way that for any two adjacent cells in the grid, the absolute difference of the values in those cells is not a prime number. Two cells in the grid are considered adjacent if they share a side.

It can be shown that under the given constraints, there is always a solution.

给定整数 $n$ 和 $m$。请将 $1$ 到 $n\cdot m$ 的整数填入一个 $n$ 行 $m$ 列的网格中，使得网格中任意两个相邻格子内的数值之差的绝对值都不是质数。若两个格子共享一条边，则称它们相邻。

在给定约束条件下，可以证明解总是存在。

The first line of the input contains a single integer $t$ ($1 \le t \le 1000$) — the number of test cases. The description of the test cases follows.

The first and only line of each test case contains two integers $n$ and $m$ ($4 \le n, m \le 1000$) — the dimensions of the grid.

It is guaranteed that the sum of $n\cdot m$ over all test cases does not exceed $10^6$.

输入的第一行包含一个整数 $t$（$1 \le t \le 1000$），表示测试用例的数量。随后是各测试用例的描述。

每个测试用例仅有一行，包含两个整数 $n$ 和 $m$（$4 \le n, m \le 1000$），表示网格的尺寸。

保证所有测试用例中 $n\cdot m$ 的总和不超过 $10^6$。

For each test case, output $n$ lines of $m$ integers each, representing the final grid. Every number from $1$ to $n\cdot m$ should appear exactly once in the grid.

The extra spaces and blank lines in the sample output below are only present to make the output easier to read, and are not required.

If there are multiple solutions, print any of them.

对于每个测试用例，输出 $n$ 行，每行 $m$ 个整数，表示最终的网格。数字 $1$ 到 $n\cdot m$ 在网格中必须恰好各出现一次。

下方样例输出中的额外空格和空行仅用于提升可读性，并非必需。

若存在多个解，输出任意一个即可。

The first sample case corresponds to the picture above. The only absolute differences between adjacent elements in this grid are $1$, $4$, $6$, $8$, and $9$, none of which are prime.

第一个样例对应于上方的图片。该网格中相邻元素之间唯一的绝对差值为 $1$、$4$、$6$、$8$ 和 $9$，其中没有一个是质数。