Raavan gave a problem to his son, Indrajeet, and asked him to solve the problem to prove his intelligence and power. The Problem was like: Given 3 integers, $N$, $K$, and $X$, produce an array $A$ of length $N$, in which the XOR of all elements of each contiguous sub-array, of length $K$, is exactly equal to $X$. Indrajeet found this problem very tricky and difficult, so, help him to solve this problem.
-----Note:-----
- $A$i must be an integer between $0$ to $10$$18$ (both inclusive), where $A$i denotes the $i$$th$ element of the array, $A$.
- If there are multiple solutions, satisfying the problem condition(s), you can print any "one" solution.
-----Input:-----
- First line will contain $T$, number of testcases. Then, the testcases follow. 
- Each testcase, contains a single line of input, of 3 integers, $N$, $K$, and $X$.
-----Output:-----
For each testcase, output in a single line, an array $A$ of $N$ integers, where each element of the array is between $0$ to $10$$18$ (both inclusive), satisfying the conditions of the problem, given by Raavan to his son.
-----Constraints:-----
- $1 \leq T \leq 1000$
- $1 \leq N \leq 10^3$
- $1 \leq K \leq N$
- $0 \leq X \leq 10$$18$
-----Sample Input:-----
3
5 1 4
5 2 4
5 3 4
-----Sample Output:-----
4 4 4 4 4
3 7 3 7 3
11 6 9 11 6
-----Explanation:-----
$Sample$ $Case$ $-$ $1$: Since, we can see, the XOR of all elements of all sub-arrays of length $1$, is equal to $4$, hence, the array {$4,4,4,4,4$}, is a valid solution to the $Sample$ $Case$ $-$ $1$. All contiguous sub-arrays of length $1$, of the output array $A$, are as follows:
[1,1]: {4} - XOR([1,1]) = $4$
[2,2]: {4} - XOR([2,2]) = $4$
[3,3]: {4} - XOR([3,3]) = $4$
[4,4]: {4} - XOR([4,4]) = $4$
[5,5]: {4} - XOR([5,5]) = $4$
t=int(input())
for i in range(t):
    n,k,x=map(int,input().split())
    X=[x]
    for i in range(0,k-1):
        X.append(0)
    i=0
    v=[]
    j=0
    while(j<n):
        v.append(X[i])
        i+=1
        if i==len(X):
            i=0
        j+=1
    print(*v)
        
t=int(input())
for i in range(t):
    n,k,x=map(int,input().split())
    X=[x]
    for i in range(0,k-1):
        X.append(0)
    i=0
    v=[]
    j=0
    while(j<n):
        v.append(X[i])
        i+=1
        if i==len(X):
            i=0
        j+=1
    print(*v)
        