题目描述
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
1 10
11 100
1 10 11
100 101 110
111 1000 1001
1 10 11 100
101 110 111 1000
1001 1010 1011 1100
1101 1110 1111 10000
-----EXPLANATION:-----
No need, else pattern can be decode easily.
输入格式
见题面
输出格式
见题面
样例输入
['4', '1', '2', '3', '4']
样例输出
['1', '1 10', '11 100', '1 10 11', '100 101 110', '111 1000 1001', '1 10 11 100', '101 110 111 1000', '1001 1010 1011 1100', '1101 1110 1111 10000']