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.
# cook your dish here
try:
 for _ in range(int(input())):
  n=int(input())
  k=n-1
  c=65
  num=1
  for i in range(0,n):
   for j in range(0,k):
    print(end=' ')
   k=k-1
   for j in range(0,i+1):
    if i%2==0:
     print(chr(c+j),end='')
    else:
     print(num+j,end='')
   print('\r')
except:pass 
     
     
     
# cook your dish here
try:
 for _ in range(int(input())):
  n=int(input())
  k=n-1
  c=65
  num=1
  for i in range(0,n):
   for j in range(0,k):
    print(end=' ')
   k=k-1
   for j in range(0,i+1):
    if i%2==0:
     print(chr(c+j),end='')
    else:
     print(num+j,end='')
   print('\r')
except:pass 
     
     
     