Problem: 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

Solution (in PYTHON):

Solution:
from sys import stdin
fib = [0,1]
for i in xrange(2,105):
	fib.append(fib[i-1]+fib[i-2])
t = int(stdin.readline())
for _ in xrange(t):
	n = int(stdin.readline())
	for i in xrange(n):
		print fib[n-i-1],
	print ""