3097: Delete

There is plenty of monster  invade rainbow land through a portal. After close the portal, Rubick, the great magician, give you a magic bar that can kill the monster. Now, the monster walk as a queue to attack you.

Here, the monster labeled from 1 to $n$ (it won't be changed). The magic bar has a initial mana $m$, every time you use the magic bar, the magic bar's mana while add by 1. If you use the magic bar, the magic bar will kill the monster which stand inthe $m$-th, $2m$-th, $3m$-th... in the queue.

After some times of using, there will some monster that you can't kill. Tell the label of every monster to the Rubick, and he will help you to kill them.

First line contains an integer $T(1\le T \le 5)$, which indicates the number of test cases.

Every test case contains an integer $n(1 \le n \le 5\times 10^5)$, which is the number of monster.

Guarantee that the sum of n in all data is less than $5 \times 10^5$ 

For every number of test cases,output the label of monster int a line separated by a space.

Do not output the extra space in the end of the line.

1
20

1 3 7 13 19