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:-----
4
1
2
3
4
-----Sample Output:-----
1
21
*1
321
*21
**1
4321
*321
**21
***1
-----EXPLANATION:-----
No need, else pattern can be decode easily.
# cook your dish here
for i in range(int(input())):
  n = int(input())
  for i in range(n,0,-1):
    temp = i
    val = n-temp
    while(val!=0):
      print("*",end="")
      val-=1
    
    while(temp!=0):
        print(temp,end="")
        temp-=1
    
    print()
# cook your dish here
for i in range(int(input())):
  n = int(input())
  for i in range(n,0,-1):
    temp = i
    val = n-temp
    while(val!=0):
      print("*",end="")
      val-=1
    
    while(temp!=0):
        print(temp,end="")
        temp-=1
    
    print()