Fibonacci Series Up To N

Given an integer N, generate the Fibonacci series up to N (inclusive). The Fibonacci sequence is defined as follows:

\(F_0 = 0,\quad F_1 = 1,\quad F_k = F_{k-1} + F_{k-2}\) for \(k \ge 2\).

Your program should read input from STDIN and print the result to STDOUT. For each test case, output the Fibonacci sequence with numbers separated by a single space.

inputFormat

The first line of input contains an integer T, the number of test cases.

Each of the following T lines contains a single integer N.

outputFormat

For each test case, output a single line containing the Fibonacci sequence up to N (inclusive). The numbers should be separated by a space.

1
0

0