You are given an integer N.

Construct a permutation P of length N such that
For all i (1 ≤ i ≤ N-1), i divides abs(P_{i+1}-P_{i}).

Recall that a permutation of length N is an array where every integer from 1 to N occurs exactly once.

It can be proven that for the given constraints at least one such P always exists.

------ Input Format ------

• The first line of input contains a single integer T, denoting the number of test cases. The description of T test cases follow.
• The only line of each test case contains an integer N - the length of the array to be constructed.

------ Output Format ------

For each test case, output $a single line containing N space-separated integers P_{1}, P_{2}, \dots, P_{N},$ denoting the elements of the array P.

If there exist multiple such arrays, print any.

------ Constraints ------

$1 ≤ T ≤ 5 \cdot 10^{4}$
$2 ≤ N ≤ 10^{5}$
- The sum of $N$ over all test cases does not exceed $10^{5}$.

----- Sample Input 1 ------
2
2
3

----- Sample Output 1 ------
1 2
2 1 3

----- explanation 1 ------
Test case 1: A possible array satisfying all the conditions is $[1, 2]$:
- For $i=1$: $abs(A_{2}-A_{1})=abs(2-1)=1$ is divisible by $1$.

Test case 2: A possible array satisfying all the conditions is $[2, 1, 3]$:
- For $i=1$: $abs(A_{2}-A_{1})=abs(1-2)=1$ is divisible by $1$.
- For $i=2$: $abs(A_{3}-A_{2})=abs(3-1)=2$ is divisible by $2$.

见题面

见题面