C1. Cool Construction (Easy Version)
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

This is the easy version of this problem. The only difference is that in this version you only need to construct any matrix satisfying the given conditions.

You are given an integer $$$n$$$. You need to construct an $$$n \times n$$$ matrix $$$a$$$ that satisfies all of the following conditions :

  • $$$1 \le a_{i,j} \le 1000$$$ for all $$$1 \le i,j \le n$$$.
  • $$$\gcd(a_{i,j}$$$ $$$,$$$ $$$i+j) \gt 1$$$ for all $$$1 \le i,j \le n$$$, here $$$\gcd$$$ means greatest common divisor.
  • The bitwise XOR of all numbers of the matrix $$$a$$$ equals $$$0$$$.
Input

The first line of input contains an integer $$$t$$$ $$$(1 \le t \le 100)$$$ — the number of testcases.

The first line of each testcase contains a single integer $$$n$$$ $$$(2 \le n \le 500)$$$.

It is guaranteed that the sum of $$$n$$$ over all testcases does not exceed $$$500$$$.

Output

For each testcase, print an $$$n \times n$$$ matrix $$$a$$$ that satisfies all the given conditions.

If there are multiple answers, print any one of them.

It can be proved that atleast one such matrix exists under the given constraints.

Example
Input
2
2
3
Output
12 12
12 12
4 6 8
3 2 5
2 10 6