Problem:
Score : 400 points

Problem Statement

Given are three integers N, K, and S.

Find a sequence A_1, A_2, ..., A_N of N integers between 1 and 10^9 (inclusive) that satisfies the condition below.
We can prove that, under the conditions in Constraints, such a sequence always exists.

There are exactly K pairs (l, r) of integers such that 1 \leq l \leq r \leq N and A_l + A_{l + 1} + \cdots + A_r = S.

Constraints

1 \leq N \leq 10^5

0 \leq K \leq N

1 \leq S \leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N K S

Output

Print a sequence satisfying the condition, in the following format:

A_1 A_2 ... A_N

Sample Input 1

4 2 3

Sample Output 1

1 2 3 4

Two pairs (l, r) = (1, 2) and (3, 3) satisfy the condition in the statement.

Sample Input 2

5 3 100

Sample Output 2

50 50 50 30 70

Solution in PyPy3 (2.4.0) (judge verdict: Wrong Answer)

def main():
    N,K,S = [int(n) for n in input().split()]
    if S == 1:
        A = []
        for i in range(K):
            A.append("1")
        for i in range(N-K):
            A.append("10")
        print(" ".join(A))
        return
    if K==1:
        A = []
        A.append(str(S))
        for i in range(N-1):
            A.append(str(S-1))
        print(" ".join(A))
        return

    if S == 2:
        A = []
        for i in range(K):
            A.append("2")
        for i in range(N-K):
            A.append("10")
        print(" ".join(A))
        return
    A = []
    for i in range(N+1):
        A.append(S*i)
    K = N-K
    for i in range(1,N+1,2):
        # print(i)
        if K == 1:
            A[-1]-=1
            break
        if K == 0:
            break
        A[i]-=1
        K-=2
    B = []
    for i in range(N):
        B.append(str(A[i+1]-A[i]))
    print(" ".join(B))
main()