The chef is trying to decode 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:-----
0
01
10
010
101
010
0101
1010
0101
1010
-----EXPLANATION:-----
No need, else pattern can be decode easily.
t = int(input())

for i in range(t):
    k = int(input()) 
    ini = [j % 2 for j in range(0, k)]
    for j in range(0, k):
        print(''.join([str((x + j) % 2) for x in ini]))
t = int(input())

for i in range(t):
    k = int(input()) 
    ini = [j % 2 for j in range(0, k)]
    for j in range(0, k):
        print(''.join([str((x + j) % 2) for x in ini]))