An array of integers $$$a_1,a_2,\cdots,a_n$$$ is beautiful subject to an integer $$$k$$$ if it satisfies the following:
It can be shown that an answer always exists.
Each test contains multiple test cases. The first line contains the number of test cases $$$t$$$ ($$$1 \le t \le 100$$$). The description of the test cases follows.
The first and only line of each test case contains a single integer $$$n$$$ ($$$1 \le n \le 100$$$) — the size of the array.
For each test case, print the required array as described in the problem statement.
3 3 6 7
4 22 18 10 6 15 32 125 54 23 18 27 36 5 66 7
In the second test case, when $$$n = 6$$$, for all integers $$$k$$$ such that $$$1 \le k \le 6$$$, let $$$S$$$ be the set of all indices of the array that are divisible by $$$k$$$.
Name |
---|