fibonacci-madness
Source: hackerearth
Difficulty: UNKNOWN_DIFFICULTY

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(input())
l = []
if 1 <= n <= 10:
    
	while n >= 1:
		x = 0
		y = 1
		a = int(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, end=' ')
			
			
		


for t in range(eval(input())):
	lst=[]
	lst.append(0)
	lst.append(1)
	lst.append(1)
	n=int(input())
	if n==1:
		print(0)
		continue
	elif n==2 or n==3:
		print("1 1 0")
		continue
	i=3
	while i<n:
		lst.append(lst[i-1]+lst[i-2])
		i=i+1
	i=n-1
	while i>=0:
		print(lst[i], end=' ')
		i=i-1
	print() 


new = [0, 1]
while len(new) != 100:
	new.append((new[len(new) - 1] + new[len(new) - 2]))
new.sort(reverse=True)

for _ in range(eval(input())):
	x=int(eval(input()))
	to=100-x
	to_print = ""
	for i in range(to,100):
		to_print+=str(new[i])+" "
	print(to_print)