CF1783B.Matrix of Differences

For a square matrix of integers of size $n \times n$, let's define its beauty as follows: for each pair of side-adjacent elements $x$ and $y$, write out the number $|x-y|$, and then find the number of different numbers among them.

For example, for the matrix $\begin{pmatrix} 1 & 3\\ 4 & 2 \end{pmatrix}$ the numbers we consider are $|1-3|=2$, $|1-4|=3$, $|3-2|=1$ and $|4-2|=2$; there are $3$ different numbers among them ($2$, $3$ and $1$), which means that its beauty is equal to $3$.

You are given an integer $n$. You have to find a matrix of size $n \times n$, where each integer from $1$ to $n^2$ occurs exactly once, such that its beauty is the maximum possible among all such matrices.

对于一个 $n \times n$ 的整数方阵，我们定义其“优美度”如下：对每一对相邻（共享一条边）的元素 $x$ 和 $y$，计算 $|x-y|$，然后统计这些差值中互不相同的数的个数。

例如，对于矩阵 $\begin{pmatrix} 1 & 3\\ 4 & 2 \end{pmatrix}$，我们考虑的差值为 $|1-3|=2$、$|1-4|=3$、$|3-2|=1$ 和 $|4-2|=2$；其中共有 $3$ 个不同的数（即 $2$、$3$ 和 $1$），因此该矩阵的优美度为 $3$。

给定一个整数 $n$。你需要构造一个 $n \times n$ 的矩阵，使得 $1$ 到 $n^2$ 中的每个整数恰好出现一次，并且该矩阵的优美度在所有满足条件的矩阵中达到最大可能值。

The first line contains a single integer $t$ ($1 \le t \le 49$) – the number of test cases.

The first (and only) line of each test case contains a single integer $n$ ($2 \le n \le 50$).

第一行包含一个整数 $t$（$1 \le t \le 49$）——测试用例的数量。

每个测试用例的第一行（也是唯一一行）包含一个整数 $n$（$2 \le n \le 50$）。

For each test case, print $n$ rows of $n$ integers — a matrix of integers of size $n \times n$, where each number from $1$ to $n^2$ occurs exactly once, such that its beauty is the maximum possible among all such matrices. If there are multiple answers, print any of them.

对于每个测试用例，输出 $n$ 行，每行 $n$ 个整数——即一个大小为 $n \times n$ 的整数矩阵，其中 $1$ 到 $n^2$ 中的每个数字恰好出现一次，且该矩阵的“美观度”在所有此类矩阵中达到最大可能值。若存在多个满足条件的答案，输出任意一个即可。