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:-----
3
2
3
4
-----Sample Output:-----
21
1
123
21
1
4321
123
21
1
-----EXPLANATION:-----
No need, else pattern can be decode easily.
for _ in range(int(input())):
 n = int(input())
 l = list(range(1, n+1))

 while l:
  if len(l) % 2 == 0:
   print(*l[::-1], sep='')
  else:
   print(*l, sep='')

  l.pop()
for _ in range(int(input())):
 n = int(input())
 l = list(range(1, n+1))

 while l:
  if len(l) % 2 == 0:
   print(*l[::-1], sep='')
  else:
   print(*l, sep='')

  l.pop()