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:-----
2
23
34
234
345
456
2345
3456
4567
5678
-----EXPLANATION:-----
No need, else pattern can be decode easily.
t=int(input())
for t in range(t):
    n=int(input())
    k=2
    for i in range(1,n+1):
        s=k
        for j in range(1,n+1):
            print(s,end="")
            s+=1
        k+=1
        print()
t=int(input())
for t in range(t):
    n=int(input())
    k=2
    for i in range(1,n+1):
        s=k
        for j in range(1,n+1):
            print(s,end="")
            s+=1
        k+=1
        print()