Pyramid Pattern Generator

You are given a positive integer T representing the number of test cases. For each test case, you are given a positive integer N which represents the number of rows for a pyramid pattern. Your task is to generate a pyramid pattern for each test case using the character '#'.

The pyramid pattern for a given N is constructed as follows:

• For each i from 1 to N-1, output a line with i '#' characters.
• Then output two consecutive lines, each containing N '#' characters.

Separate the output of different test cases with an empty line (i.e. two newline characters). Note that all formulas in this problem should be written in LaTeX format. For example, the number of rows in a pyramid is denoted by \(N\).

Example:

Input:
3
1
2
3
Output:

inputFormat

The first line of the input contains a single integer T (\(T \ge 1\)) representing the number of test cases. Each of the following T lines contains one integer N (\(N \ge 1\)), which is the number of rows for that test case's pyramid pattern.

Input is provided via standard input (stdin).

outputFormat

For each test case, output the corresponding pyramid pattern using '#' characters as described. Separate the pyramid patterns of different test cases with an empty line.

Output should be written to standard output (stdout).

## sample

1
1

#
#

</p>