We call a permutation $p$ of length $n$ "Avid" if the following expression takes the maximum value: $$ \sum_{i=2}^n|p_i-p_{i-1}| $$ Your task is for a given number $n$, find the **lexicographically smallest** "Avid" permutation of length $n$. - A permutation of length $n$ means that each integer from $1$ to $n$ occurs exactly once in the sequence.

The first line contains a single integer $T$ --- the amount of test cases. Next $T$ lines, each line contains a single integer $n$, representing the given number. $1\le T\le 100$ $1\le n\le 10000$

For each test case, print the lexicographically smallest "Avid" permutation of length $n$ in one line, separated by spaces.

Clarification for 2nd sample: Both $\{1,3,2\}$ and $\{2,3,1\}$ can take the maximum value $|1-3|+|3-2|=3$, but $\{1,3,2\}$ is lexicographically smaller than $\{2,3,1\}$.