CF1758D.Range = √Sum

You are given an integer $n$. Find a sequence of $n$ distinct integers $a_1, a_2, \dots, a_n$ such that $1 \leq a_i \leq 10^9$ for all $i$ and $$\max(a_1, a_2, \dots, a_n) - \min(a_1, a_2, \dots, a_n)= \sqrt{a_1 + a_2 + \dots + a_n}.$$

It can be proven that there exists a sequence of distinct integers that satisfies all the conditions above.

给你一个整数 $n$。请找出一个由 $n$ 个互不相同的整数 $a_1, a_2, \dots, a_n$ 构成的序列，使得对所有 $i$ 都有 $1 \leq a_i \leq 10^9$，且满足

$$\max(a_1, a_2, \dots, a_n) - \min(a_1, a_2, \dots, a_n)= \sqrt{a_1 + a_2 + \dots + a_n}.$$

可以证明，总存在一个满足上述所有条件的互不相同整数序列。

The first line of input contains $t$ ($1 \leq t \leq 10^4$) — the number of test cases.

The first and only line of each test case contains one integer $n$ ($2 \leq n \leq 3 \cdot 10^5$) — the length of the sequence you have to find.

The sum of $n$ over all test cases does not exceed $3 \cdot 10^5$.

输入的第一行包含 $t$（$1 \leq t \leq 10^4$）——测试用例的数量。

每个测试用例仅有一行，包含一个整数 $n$（$2 \leq n \leq 3 \cdot 10^5$）——你需要构造的序列的长度。

所有测试用例的 $n$ 值之和不超过 $3 \cdot 10^5$。

For each test case, output $n$ space-separated distinct integers $a_1, a_2, \dots, a_n$ satisfying the conditions in the statement.

If there are several possible answers, you can output any of them. Please remember that your integers must be distinct!

对于每个测试用例，输出 $n$ 个以空格分隔的互不相同的整数 $a_1, a_2, \dots, a_n$，使其满足题目陈述中的条件。

若存在多个可能的答案，你可以输出其中任意一个。请注意：你输出的整数必须互不相同！

In the first test case, the maximum is $3$, the minimum is $1$, the sum is $4$, and $3 - 1 = \sqrt{4}$.

In the second test case, the maximum is $29$, the minimum is $18$, the sum is $121$, and $29-18 = \sqrt{121}$.

For each test case, the integers are all distinct.

在第一个测试用例中，最大值为 $3$，最小值为 $1$，和为 $4$，且 $3 - 1 = \sqrt{4}$。

在第二个测试用例中，最大值为 $29$，最小值为 $18$，和为 $121$，且 $29-18 = \sqrt{121}$。

对于每个测试用例，所有整数互不相同。