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 C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<iostream>

using namespace std;

#define NMAX 100000
int main(){
    /*long long N,X[NMAX],L[NMAX];

    cin>>N;
    for(int i=0;i<N;i++){
        cin>>X[i];
        cin>>L[i];
    }*/

    long long N,K,S;
    long long a[2];

    cin>>N>>K>>S;
    a[0]=S/2;
    a[1]=S-a[0];
    if(S==1){
        for(int i=0;i<N;i++){
            if(K>=1) cout<<"1";
            else{
                if(S!=1000000000) cout<<"1000000000";
                else cout<<"999999999";
            }
            if(i>=0) K--;
            if(i!=N-1) cout<<" ";
            else cout<<endl;
        }
    }
    else{
        for(int i=0;i<N;i++){
            if(K>=1) cout<<a[i%2];
            else{
                if(S!=1000000000) cout<<"1000000000";
                else cout<<"999999999";
            }
            if(i>=1) K--;
            if(i!=N-1) cout<<" ";
            else cout<<endl;
        }
    }


}