Problem: Problem :

Bajirao asks Avni out on a date. However, Avni will go out with him only on one condition : 

Bajirao has to tell her all possible N - digit numbers such that all the digits of every number he tells her are distinct , non-zero and   less than or equal to N. 

Also, he has to tell her all these numbers in ascending order. Help Bajirao so that he can take Avni out on a date.

Input

First line consists of T the number of test cases. The next T lines are such that each line consists of a single integer N.

Output

For every test case, print all the numbers Bajirao tells Avni, such that the numbers are in ascending order and every number is separated from the other by a single space. Print the answer to every test case on a new line.

Constraints :

1 ≤ T ≤ 3

1 ≤ N ≤ 9

Problem Setter : Shreyans

Problem Tester : Sandeep

(By IIT Kgp HackerEarth Programming Club)

SAMPLE INPUT
3
1
2
3

SAMPLE OUTPUT
1
12 21
123 132 213 231 312 321

Solution (in PYTHON):

Solution:
def permutationG(input, s):
    if len(s) == len(input): yield s
    for i in input:
        if i in s: continue
        s=s+i
        for x in permutationG(input, s): yield x
        s=s[:-1]

j = int(raw_input())
while (j > 0):
    i = int(raw_input())
    s = ""
    for k in range(1,i+1):
        s = s+str(k)
    l = list(permutationG(s,''))
    for k in range(len(l)):
        print int(l[k]),
    print ''
    j -= 1