Given an integer n print all the possibilities of a % n.

Input

The first line consists of an integer t, the number of test cases followed by t lines containing an integer n.

Output

For each test case print all the possibilities of a%n in descending order separated by a single space. After each test case print a new line character. If there are no possibilities print "NOT POSSIBLE".

Constraints

0 < t <= 100

0 <= N <= 100

Example

Input:
2
1
2

Output:
0
1 0