The chef is trying to solve some pattern problems, Chef wants your help to code it. Chef has one number K to form new pattern. Help the chef to code this pattern problem.
-----Input:-----
- First line will contain $T$, number of testcases. Then the testcases follow. 
- Each testcase contains of a single line of input, one integer $K$. 
-----Output:-----
For each testcase, output as pattern.
-----Constraints-----
- $1 \leq T \leq 100$
- $1 \leq K \leq 100$
-----Sample Input:-----
2
2
4
-----Sample Output:-----
2
12
012
12
2
4
34
234
1234
01234
1234
234
34
4
-----EXPLANATION:-----
No need, else pattern can be decode easily.
# cook your dish here
def gcd(x, y):
    while y:
        x, y = y, x % y
    return x

def lcm(x, y):
    return (x*y)//(gcd(x,y))


abc="abcdefghijklmnopqrstuvwxyz"

pi=3.141592653589793238




t = int(input())
for _ in range(t):
    k = int(input())
    k_buf = k*1
    n_lines = k + 1
    for i in range(n_lines):
        buf = " "*k
        for j in range(k,k_buf+1):
            buf=buf+str(j)
        k = k - 1
        print(buf)
    for i in range(1,k_buf+1):
        buf=" "*i
        for j in range(i,k_buf+1):
            buf = buf+str(j)
        print(buf)
    
    
    

# cook your dish here
def gcd(x, y):
    while y:
        x, y = y, x % y
    return x

def lcm(x, y):
    return (x*y)//(gcd(x,y))


abc="abcdefghijklmnopqrstuvwxyz"

pi=3.141592653589793238




t = int(input())
for _ in range(t):
    k = int(input())
    k_buf = k*1
    n_lines = k + 1
    for i in range(n_lines):
        buf = " "*k
        for j in range(k,k_buf+1):
            buf=buf+str(j)
        k = k - 1
        print(buf)
    for i in range(1,k_buf+1):
        buf=" "*i
        for j in range(i,k_buf+1):
            buf = buf+str(j)
        print(buf)
    
    
    
