CF1632B.Roof Construction

It has finally been decided to build a roof over the football field in School 179. Its construction will require placing $n$ consecutive vertical pillars. Furthermore, the headmaster wants the heights of all the pillars to form a permutation $p$ of integers from $0$ to $n - 1$, where $p_i$ is the height of the $i$-th pillar from the left $(1 \le i \le n)$.

As the chief, you know that the cost of construction of consecutive pillars is equal to the maximum value of the bitwise XOR of heights of all pairs of adjacent pillars. In other words, the cost of construction is equal to $\max\limits_{1 \le i \le n - 1}{p_i \oplus p_{i + 1}}$, where $\oplus$ denotes the bitwise XOR operation.

Find any sequence of pillar heights $p$ of length $n$ with the smallest construction cost.

In this problem, a permutation is an array consisting of $n$ distinct integers from $0$ to $n - 1$ in arbitrary order. For example, $[2,3,1,0,4]$ is a permutation, but $[1,0,1]$ is not a permutation ($1$ appears twice in the array) and $[1,0,3]$ is also not a permutation ($n=3$, but $3$ is in the array).

最终决定为第179中学的足球场建造一个顶棚。其施工需要安装 $n$ 根连续的垂直支柱。此外，校长希望所有支柱的高度构成一个 $0$ 到 $n - 1$ 的排列 $p$，其中 $p_i$ 表示从左往右数第 $i$ 根支柱的高度（$1 \le i \le n$）。

作为总工程师，您知道：连续支柱的施工成本等于所有相邻支柱高度对的按位异或（XOR）值中的最大值。换言之，施工成本等于 $\max\limits_{1 \le i \le n - 1}{p_i \oplus p_{i + 1}}$，其中 $\oplus$ 表示按位异或运算。

请找出任意一个长度为 $n$ 的支柱高度序列 $p$，使其施工成本最小。

在本题中，排列指由 $0$ 到 $n - 1$ 这 $n$ 个互不相同的整数以任意顺序组成的数组。例如，$[2,3,1,0,4]$ 是一个排列；而 $[1,0,1]$ 不是排列（数字 $1$ 在数组中出现了两次），$[1,0,3]$ 也不是排列（此时 $n = 3$，但数组中却包含了 $3$）。

Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1 \le t \le 10^4$). Description of the test cases follows.

The only line for each test case contains a single integer $n$ ($2 \le n \le 2 \cdot 10^5$) — the number of pillars for the construction of the roof.

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

每个测试包含多个测试用例。第一行包含测试用例的数量 $t$（$1 \le t \le 10^4$）。随后是各测试用例的描述。

每个测试用例仅一行，包含一个整数 $n$（$2 \le n \le 2 \cdot 10^5$）——表示用于建造屋顶的柱子数量。

保证所有测试用例的 $n$ 之和不超过 $2 \cdot 10^5$。

For each test case print $n$ integers $p_1$, $p_2$, $\ldots$, $p_n$ — the sequence of pillar heights with the smallest construction cost.

If there are multiple answers, print any of them.

对于每个测试用例，输出 $n$ 个整数 $p_1$, $p_2$, $\ldots$, $p_n$ —— 即构造成本最小的柱子高度序列。

若存在多个答案，输出其中任意一个即可。

For $n = 2$ there are $2$ sequences of pillar heights:

• $[0, 1]$ — cost of construction is $0 \oplus 1 = 1$.
• $[1, 0]$ — cost of construction is $1 \oplus 0 = 1$.

For $n = 3$ there are $6$ sequences of pillar heights:

• $[0, 1, 2]$ — cost of construction is $\max(0 \oplus 1, 1 \oplus 2) = \max(1, 3) = 3$.
• $[0, 2, 1]$ — cost of construction is $\max(0 \oplus 2, 2 \oplus 1) = \max(2, 3) = 3$.
• $[1, 0, 2]$ — cost of construction is $\max(1 \oplus 0, 0 \oplus 2) = \max(1, 2) = 2$.
• $[1, 2, 0]$ — cost of construction is $\max(1 \oplus 2, 2 \oplus 0) = \max(3, 2) = 3$.
• $[2, 0, 1]$ — cost of construction is $\max(2 \oplus 0, 0 \oplus 1) = \max(2, 1) = 2$.
• $[2, 1, 0]$ — cost of construction is $\max(2 \oplus 1, 1 \oplus 0) = \max(3, 1) = 3$.

当 $n = 2$ 时，存在 $2$ 种柱子高度序列：

• $[0, 1]$ — 建造成本为 $0 \oplus 1 = 1$。
• $[1, 0]$ — 建造成本为 $1 \oplus 0 = 1$。

当 $n = 3$ 时，存在 $6$ 种柱子高度序列：

• $[0, 1, 2]$ — 建造成本为 $\max(0 \oplus 1, 1 \oplus 2) = \max(1, 3) = 3$。
• $[0, 2, 1]$ — 建造成本为 $\max(0 \oplus 2, 2 \oplus 1) = \max(2, 3) = 3$。
• $[1, 0, 2]$ — 建造成本为 $\max(1 \oplus 0, 0 \oplus 2) = \max(1, 2) = 2$。
• $[1, 2, 0]$ — 建造成本为 $\max(1 \oplus 2, 2 \oplus 0) = \max(3, 2) = 3$。
• $[2, 0, 1]$ — 建造成本为 $\max(2 \oplus 0, 0 \oplus 1) = \max(2, 1) = 2$。
• $[2, 1, 0]$ — 建造成本为 $\max(2 \oplus 1, 1 \oplus 0) = \max(3, 1) = 3$。