It has finally been decided to build a roof over the football field in School 179. Its construction will require placingconsecutive vertical pillars. Furthermore, the headmaster wants the heights of all the pillars to form a permutation of integers from to , where is the height of the -th pillar from the left .
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 , where denotes the bitwise XOR operation.
Find any sequence of pillar heightsof length with the smallest construction cost.
In this problem, a permutation is an array consisting ofdistinct integers from to in arbitrary order. For example, is a permutation, but is not a permutation ( appears twice in the array) and is also not a permutation ( , but is in the array).
Each test contains multiple test cases. The first line contains the number of test cases( ). Description of the test cases follows.
The only line for each test case contains a single integer( ) — the number of pillars for the construction of the roof.
It is guaranteed that the sum ofover all test cases does not exceed .Roof Construction Codeforces
For each test case printintegers , , , — the sequence of pillar heights with the smallest construction cost.
If there are multiple answers, print any of them. Roof Construction Codeforces
4 2 3 5 10
0 1 2 0 1 3 2 1 0 4 4 6 3 2 0 8 9 1 7 5