SP27521 DOM - Domino's effect

_Original problem statement (in Polish) can be found [here](https://pizza.natodia.net/static/tasks/2016/eliminations/efekt.pdf)._ Dominik "Domino" Domański is a scientist. He's conducting research on quantum physics. Lately, he started taking a closer look at certain very interesting effect, which can be observed when some quantum objects interact. In his next experiment, he placed **n** infinitely thin lines on the table, perpendicularly to the surface, in a row. Lines have different heights, distances between the lines can also differ. (Dominik calls these lines "domino tiles"). Looking from the front, they look like **n** segments, standing vertically on the X axis of the Cartesian coordinate system. Domino tiles can be toppled. If a tile has a height of **h**, it will topple other tiles at most **h** units away. More precisely, if tile is placed at the position **x**, and is knocked over to the right, it will topple the tiles placed at positions **x**+1, **x**+2, ..., **x**+**h**. If this tile is knocked over to the left, it will topple the tiles at positions **x**-1, **x**-2, ..., **x**-**h**. Dominik observed a very interesting phenomenon, which he called "Domino's effect" - toppling one domino tile can cause other tiles to topple, which can in turn topple other tiles. He started to wonder how to take advantage of this effect in a best possible way. What is the minimum number of tiles that need to be toppled, in order for all the dominoes to fall?

The first line contains a single integer **t**, denoting the number of testcases. Then, testcases follow. The description of a single testcase begins with a single integer **n** (1

For every testcase you should find a sequence of domino tiles, that will knock down the whole arrangement. It should begin with an integer **k** (1