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 100$
- $1 \leq K \leq 100$
-----Sample Input:-----
4
1
2
3
4
-----Sample Output:-----
1
12
3
123
45
6
1234
567
89
10
-----EXPLANATION:-----
No need, else pattern can be decode easily.
t = int(input())
for _ in range(t):
    n = int(input())
    count = 1
    for i in range(n):
        for j in range(n-i):
            print(count,end='')
            count += 1
        print()
t = int(input())
for _ in range(t):
    n = int(input())
    count = 1
    for i in range(n):
        for j in range(n-i):
            print(count,end='')
            count += 1
        print()