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:-----
1 
1 01 
11 001 
1 01 11 
001 101 011 
111 0001 1001 
1 01 11 001 
101 011 111 0001 
1001 0101 1101 0011 
1011 0111 1111 00001 

-----EXPLANATION:-----
No need, else pattern can be decode easily.

Difficulty: interview

Starter code:

Solutions:
t=int(input())
while(t):
    n=int(input())
    cnt=1;
    for i in range(n):
        s=""
        for j in range(n):
            s=s+str(bin(cnt))[2:][: : -1]+" "
            cnt=cnt+1
        print(s)
            
    t=t-1

# cook your dish here
for _ in range(int(input())):
    n = int(input())
    count = 1
    for i in range(n):
        for j in range(n):
            x = bin(count)[2:]
            x = x[::-1]
            print( x , end=" ")
            count += 1
        print()

def f(n):
    p = 1 
    i = 1
    while i<=n:
        j = 1
        while j<= n:
            print((str(bin(p))[2:])[::-1], "", end="")
            p += 1
            j += 1
        print()
        i += 1

t = int(input())
answers = list()
for _ in range(t):
    n = int(input())
    answers.append(n)

for answer in answers:
    f(answer)

for _ in range(int(input())):
    N = int(input())
    
    K = 1
    for i in range(N):
        for j in range(N):
            B = bin(K)[2:]
            K += 1
            print(B[::-1], end = " ")
        print()
    

from sys import stdin, stdout
from math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log
from collections import defaultdict as dd, deque
from heapq import merge, heapify, heappop, heappush, nsmallest
from bisect import bisect_left as bl, bisect_right as br, bisect
mod = pow(10, 9) + 7
mod2 = 998244353
def inp(): return stdin.readline().strip()
def out(var, end="\n"): stdout.write(str(var)+"\n")
def outa(*var, end="\n"): stdout.write(' '.join(map(str, var)) + end)
def lmp(): return list(mp())
def mp(): return map(int, inp().split())
def smp(): return map(str, inp().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]
def remadd(x, y): return 1 if x%y else 0
def ceil(a,b): return (a+b-1)//b

def isprime(x):
    if x<=1: return False
    if x in (2, 3): return True
    if x%2 == 0: return False
    for i in range(3, int(sqrt(x))+1, 2):
        if x%i == 0: return False
    return True
    
for _ in range(int(inp())):
    n = int(inp())
    k = 1
    for i in range(n):
        for j in range(n):
            print(bin(k)[2:][::-1],end=" ")
            k+=1
        print()