The chef is trying to solve 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 100$
- $1 \leq K \leq 100$
-----Sample Input:-----
5
1
2
3
4
5
-----Sample Output:-----
1
1
32
1
32
654
1
32
654
10987
1
32
654
10987
1514131211
-----EXPLANATION:-----
No need, else pattern can be decode easily.
# cook your dish here
for i in range(int(input())):
    p=int(input())
    k=1
    print(1,end="")
    print()
    s=0
    for i in range(1,p):
        k+=i+1
        x=k
        for j in range(i+1):
            print(x,end="")
            x-=1
        print()

# cook your dish here
for i in range(int(input())):
    p=int(input())
    k=1
    print(1,end="")
    print()
    s=0
    for i in range(1,p):
        k+=i+1
        x=k
        for j in range(i+1):
            print(x,end="")
            x-=1
        print()
