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 Fortran (gfortran v4.8.4) (judge verdict: Accepted)

program key2020_C
    implicit none
    integer::N,K,S
    integer::i
    read*,N,K,S
    if(K/=0)then
        write(*,"(i0)",advance="no")S
    else
        write(*,"(i0)",advance="no")merge(S+1,S-1,S/=10**9)
    endif
    do i=2,K
        write(*,"(A,i0)",advance="no")" ",S
    end do
    do i=K+1,N
        if(K==0.and.i==N)exit
         write(*,"(A,i0)",advance="no")" ",merge(S+1,S-1,S/=10**9)
    end do
    write(*,*)
end program key2020_C