Dream Permutation#12461
You're given an integer , a permutation of elements achieves TaklaOI's dream if the following condition holds.
for all (1 \le i < n) : (p_{i} + p_{i+1}) (n + 1) \in \{0,n\}
Find a permutation of elements that achieves TaklaOI's dream.
It can be shown that the permutation always exists.
The first line contains a single integer (1 \le t \le 600) — the number of test cases.
The first line of each test case contains a single integer (2 \le n \le 10^5).
It's guaranteed that the sum of over all test cases does not exceed 2 \cdot 10^5.
For each test case, print a permutation of elements.
If there are multiple answers , print any of them.
Example 1
Subtask ( points): No additional constraints.