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 
1 10 
11 100 
1 10 11 
100 101 110 
111 1000 1001 
1 10 11 100 
101 110 111 1000 
1001 1010 1011 1100 
1101 1110 1111 10000 

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

Difficulty: UNKNOWN_DIFFICULTY

Solutions:
t = int(input())
for _ in range(t):
	k = int(input())
	count = 1
	for _ in range(k):
		output = []
		for index in range(1, k + 1):
			output.append(bin(count).replace('0b', ''))
			count += 1
		print(*output)


t = int(input())
for i in range(t):
	k = int(input())
	for j in range(0, k):
		print(' '.join([str(bin(x + 1)[2:]) for x in range(j * k, j * k + k)]))


for _ in range(int(input())):
	n = int(input())
	j = 1
	for i in range(1, n + 1):
		l = []
		for _ in range(1, n + 1):
			l.append(bin(j)[2:])
			j += 1
		print(*l, sep=' ')