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 26$
- $1 \leq K \leq 26$

-----Sample Input:-----
2
2
4

-----Sample Output:-----
A
12
A
12
ABC
1234

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

Difficulty: UNKNOWN_DIFFICULTY

Solutions:
n = int(input())
for i in range(n):
	m = int(input())
	a = ''
	b = '1'
	p = 65
	q = 2
	for j in range(m):
		if j % 2 == 0:
			a = a + chr(p)
			print(a)
			p += 1
			a = a + chr(p)
			p += 1
		else:
			b = b + str(q)
			print(b)
			q = q + 1
			b = b + str(q)
			q = q + 1


import string
a = string.ascii_uppercase
b = [i for i in range(1, 27)]
for _ in range(int(input())):
	k = int(input())
	if k == 1:
		print('A')
		continue
	for i in range(1, k + 1):
		if i % 2 != 0:
			print(a[:i])
		else:
			print(''.join((str(j) for j in range(1, i + 1))))