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)

n, k, s = map(int, input().split())
s_len = n - k + 1
result = []
if k != 0:
    if s == pow(10, 9):

            add_num = pow(10, 9) // 2
            result.append(add_num)
            for _ in range(1, k+1):
                result.append(add_num)
            for _ in range(k+1, n):
                result.append(1)

    else:
        for _ in range(k):
            result.append(s)

        for _ in range(k, n):
            result.append(pow(10, 9))
else:
    if not s == pow(10, 9):
        for _ in range(n):
            result.append(s+1)
    else:
        for _ in range(n):
            result.append(1)
print(' '.join(map(str, result)))