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:-----
12
21
123
231
312
1234
2341
3412
4123
-----EXPLANATION:-----
No need, else pattern can be decode easily.
for tc in range(int(input())):
    K = int(input())
    S = [str(i) for i in range(1, K + 1)]
    for i in range(K):
        print(''.join(S))
        S = S[1:] + [S[0]]
for tc in range(int(input())):
    K = int(input())
    S = [str(i) for i in range(1, K + 1)]
    for i in range(K):
        print(''.join(S))
        S = S[1:] + [S[0]]