The chef is trying to decode some pattern problems, Chef wants your help to code it. Chef has one number K to form a new pattern. Help the chef to code this pattern problem.
-----Input:-----
- First-line will contain $T$, the number of test cases. Then the test cases follow. 
- Each test case contains a single line of input, one integer $K$. 
-----Output:-----
For each test case, output as the pattern.
-----Constraints-----
- $1 \leq T \leq 10$
- $1 \leq K \leq 10$
-----Sample Input:-----
4
1
2
3
4
-----Sample Output:-----
0 
0 
1 1 
0 
1 1 
2 3 5 
0 
1 1 
2 3 5 
8 13 21 34  
-----EXPLANATION:-----
No need, else pattern can be decode easily.
t = int(input())
f = [0, 1]
for i in range(2, 100):
 f.append(f[i - 1] + f[i - 2])
 # print(f[i], ' ')
for i in range(t):
 n = int(input())
 cnt = 0
 for j in range(1, n + 1):
  for k in range(1, j + 1):
   print(f[cnt], end=' ')
   cnt += 1
  print()
t = int(input())
f = [0, 1]
for i in range(2, 100):
 f.append(f[i - 1] + f[i - 2])
 # print(f[i], ' ')
for i in range(t):
 n = int(input())
 cnt = 0
 for j in range(1, n + 1):
  for k in range(1, j + 1):
   print(f[cnt], end=' ')
   cnt += 1
  print()