C. Good Permutation
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Pavan Kalyan likes permutations$$$^\dagger$$$. But Yugandhar likes Good permutations. So he asked Pavan Kalyan to give him a Good permutation of length $$$n$$$.

A permutation $$$P$$$ of length $$$n$$$ $$$(p_1,p_2,p_3.....,p_n)$$$ is Good if $$$F(P)$$$ has a minimum value.

Where, $$$$$$F(P)=\sum_{i = 1}^n⌊\frac{p_i}{i}⌋$$$$$$

Where, ⌊$$$x$$$⌋ denotes rounding down of $$$x$$$.

$$$^\dagger$$$ A permutation is an array of length $$$n$$$, where each number from $$$1$$$ to $$$n$$$ appears exactly once

Input

Each test contains multiple test cases. The first line contains the number of test cases $$$t$$$ ($$$1 \le t \le 1000$$$). The description of the test cases follows.

The first line of each testcase contains a single integer $$$n$$$ ($$$1 \le n \le 10^5$$$), the length of the Good permutation.

It is guaranteed that the sum of $$$n$$$ over all test cases does not exceed $$$10^5$$$.

Output

For each test case, print a Good permutation of length $$$n$$$.

If there are several answers, output any.

Example
Input
4
1
2
3
4
Output
1
1 2
1 3 2
1 4 2 3