Construct a Sequence

Construct an integer sequence $A$ of length $N$ satisfying all of the following conditions.

• All elements are distinct.
• Every element is between $1$ and $2N$.
• For every contiguous subsequence, its sum divided by its length is an integer.

The input is given in the following format:

$T$ case$_1$ case$_2$ $\vdots$ case$_T$

Each test case is given in the following format:

$N$

For each test case, print a valid sequence $A_1, A_2, \cdots, A_N$ on one line. If there are multiple solutions, print any of them.

• $1 \leq T \leq 100$.
• $1 \leq N \leq 2\,000$.
• The sum of $N$ over all test cases does not exceed $2\,000$.