C-Ah, It's Yesterday Once More_第十九届浙大城市学院程序设计竞赛（同步赛）

时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
Special Judge, 64bit IO Format: %lld

题目描述

Boboge remembers The 2021 ICPC Asia Nanjing Regional Contest, Problem D. The problem gives you an array $a$ and asks you how many times the expression ''Swap $a_i$ and $a_j$ '' has been executed if you call $Sort(a)$ which is implemented by the following Algorithm 1.

As the algorithm looks quite like the normal bubble sort, Boboge wants you to construct a permutation of length $n$ as the array $a$ , so that the number of times the expression ''Swap $a_i$ and $a_j$ '' has been executed equals to the number of times the expression ''Swap $a_j$ and $a_{j+1}$ '' has been executed when we call $Sort(a)$ and $BubbleSort(a)$ respectively.
A permutation is an array consisting of $n$ distinct integers from $1$ to $n$ in arbitrary order. For example, $[2,3,1,5,4]$ is a permutation, but $[1,2,2]$ is not a permutation ( $2$ appears twice in the array), and $[1,3,4,5]$ is also not a permutation ( $n=4$ but there is $5$ in the array).

输入描述:

The first line contains a single integer  --- the number of test cases.
Each test case consists of one line containing one integer  --- the length of permutation that you need to construct.
It is guaranteed that  over all test cases.

输出描述:

For each test case, print  integers in a line --- the permutation you construct.
If there are multiple answers, print any. It can be proved that there is always a valid answer.

示例1

输入

复制

2
1
2

输出

复制

1
2 1