Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
B. Matrix of Differences

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputFor 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.

Input

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$$$).

Output

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.

Example

Input

223

Output

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

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jan/28/2023 17:02:19 (j3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|