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: Accepted)

#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double PI=acos(-1);

int main(){
    ll n, k, s;
    cin >> n >> k >> s;
    ll a[2] = {s/2, s%2 == 1 ? s/2 + 1 : s/2};
    rep(i, n){
        if(i > 0) cout << " ";
        if(k == n){
            cout << s;
            continue;
        }
        if(i <= k){
            if(s != 1) cout << a[i%2];
            else if(s == 1 && i < k) cout << "1";
            else cout << "2";
        }else{
            if(s == 1000000000) cout << "1";
            else cout << s+1;
        }
    }
    cout << endl;
    return 0;
}