#K55762. Zoo Enclosures Layout

    ID: 30048 Type: Default 1000ms 256MiB

Zoo Enclosures Layout

Zoo Enclosures Layout

In this problem, you are given a number of test cases. For each test case, you are provided with a single integer n representing the size of the enclosure layout. You need to generate a pattern consisting of n rows for each test case. In the i-th row (1-indexed), print the i-th uppercase English letter repeated n times. An empty line should separate the output of different test cases.

The letter in row i is determined by the formula:

\( \text{Letter} = \mathrm{chr}(65 + i - 1) \)

For example, if n = 3, the pattern will be:

AAA
BBB
CCC

inputFormat

The input starts with an integer T representing the number of test cases. Then, T lines follow where each line contains a single integer n representing the size of the enclosure layout for that test case.

Input Format:

T
n1
n2
...
nT

outputFormat

For each test case, output n lines corresponding to the layout of the zoo enclosures. After each test case (except the last one), print an empty line.

## sample
1
1
A