Pierre is recently obsessed with an online game. To encourage users to log in, this game will give users a continuous login reward. The mechanism of continuous login reward is as follows: If you have not logged in on a certain day, the reward of that day is 0, otherwise the reward is the previous day's plus 1.

On the other hand, Pierre is very fond of the number `N`. He wants to get exactly `N` points reward with the least possible interruption of continuous login.

There are multiple test cases. The first line of input is an integer `T` indicates the number of test cases. For each test case:

There is one integer `N` (1 <= `N` <= 123456789).

For each test case, output the days of continuous login, separated by a space.

This problem is special judged so any correct answer will be accepted.

提交代码