This is Fibonacci madness.
Given a number n. Print the first n Fibonacci numbers in reverse order.

Input:

First line is number T denoting number of test cases.
T lines follow. Each line has number N.

Output:

Print the first n Fibonacci numbers in reverse order for all test cases.

Constraints:

1 ≤ T ≤ 10

0 ≤ N ≤ 100

Example

Input:
3

1

7

4
Output:
0

8 5 3 2 1 1 0 

2 1 1 0

SAMPLE INPUT
3
1
7
4

SAMPLE OUTPUT
0 
8 5 3 2 1 1 0 
2 1 1 0
n= int(raw_input())
l = []
if 1 <= n <= 10:
    
    while n >= 1:
        x = 0
        y = 1
        a = int(raw_input())
        list1 =[]

        if 1 <= a <= 100:
            while a >= 1:
                list1.append(x)
                c = x
                x = y
                y = c+x
                a -= 1
        list1.reverse()       
        l.append(list1)
        n -=1
        
for i in l:
    for id,j in enumerate(i):
        if id == len(i)-1:
            print j
        else:
            print j,