题目描述
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 100$
- $1 \leq K \leq 100$
-----Sample Input:-----
5
1
2
3
4
5
-----Sample Output:-----
*
*
**
*
**
*
**
* *
*
**
* *
* *
-----EXPLANATION:-----
No need, else pattern can be decode easily.
输入格式
见题面
输出格式
见题面
样例输入
['5', '1', '2', '3', '4', '5']
样例输出
['*', '*', '**', '*', '**', '***', '*', '**', '* *', '****', '*', '**', '* *', '* *', '*****']