Given an input n, print Floyd's triangle with n lines.
Input:
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains an integer n.
Output:
Print the Floyd's triangle with n lines.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains an integer n.
Output:
Print the Floyd's triangle with n lines.
Constraints:
1<=T<=10
1<=N<=20
Example:
1<=T<=10
1<=N<=20
Example:
Input:
2
4
5
2
4
5
Output:
1
2 3
4 5 6
7 8 9 10
1
2 3
4 5 6
7 8 9 10
11 12 13 14 15
1
2 3
4 5 6
7 8 9 10
1
2 3
4 5 6
7 8 9 10
11 12 13 14 15