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
5
3
4
-----Sample Output:-----
1   1
2 2
3
4 4
5   5
1 1
2
3 3
1  1
22
33
4  4
-----EXPLANATION:-----
No need, else pattern can be decode easily.
try:
    t = int(input())
    for a in range(t):
        k = int(input())
        x = 0
        y = k-1
        n = 1
        for i in range(k):
            for j in range(k):
                if (j==x or j==y):
                    print(n,end="")
                else:
                    print(" ",end="")
            x+=1
            y-=1
            n+=1
            print()
except EOFError:
    pass
try:
    t = int(input())
    for a in range(t):
        k = int(input())
        x = 0
        y = k-1
        n = 1
        for i in range(k):
            for j in range(k):
                if (j==x or j==y):
                    print(n,end="")
                else:
                    print(" ",end="")
            x+=1
            y-=1
            n+=1
            print()
except EOFError:
    pass