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:-----
4
1
2
3
4
-----Sample Output:-----
1
13
57
135
7911
131517
1357
9111315
17192123
25272931
-----EXPLANATION:-----
No need, else pattern can be decode easily.
t=int(input())
for i in range(0,t):
    n=int(input())
    p=1
    for j in range(0,n):
        for k in range(0,n):
            print(p,end="")
            p=p+2
        print(" ")
t=int(input())
for i in range(0,t):
    n=int(input())
    p=1
    for j in range(0,n):
        for k in range(0,n):
            print(p,end="")
            p=p+2
        print(" ")