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:-----
3
2
3
4
-----Sample Output:-----
1121
1222
112131
122232
132333
11213141
12223242
13233343
14243444
-----EXPLANATION:-----
No need, else pattern can be decode easily.
for _ in range(int(input())):
    n=int(input())
    b=1
    # 1112
    # 2122
    for _ in range(1,n+1):
        a=1
        for __ in range((2*n)):
            if __%2==0:
                print(a,end="")
                a+=1
            else:
                print(b,end="")
        b+=1
        print()
    print()    
for _ in range(int(input())):
    n=int(input())
    b=1
    # 1112
    # 2122
    for _ in range(1,n+1):
        a=1
        for __ in range((2*n)):
            if __%2==0:
                print(a,end="")
                a+=1
            else:
                print(b,end="")
        b+=1
        print()
    print()    