


The first line contains a single integer ‘T’ representing the number of test cases.
The first line of each test case will contain an integer ‘N’ that is the total number of rows.
For each test case, print the pattern of N lines.
Output for every test case will be printed in a separate line.
1 <= N <= 900
The basic idea of this approach is to print the pattern row-wise. The pattern consists of ’N’ rows. Each row contains 2 * ‘N’ - 1 star. In addition to these stars, there are leading spaces. Each row contains ‘N’ - ‘Row’ spaces (where ‘ROW’ is the current row number).
Here is the algorithm: