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 Rust (1.15.1) (judge verdict: Accepted)

use std::io::*;

fn main() {
    let mut s: String = String::new();
    std::io::stdin().read_to_string(&mut s).ok();
    let mut itr = s.trim().split_whitespace();
    let n: usize = itr.next().unwrap().parse().unwrap();
    let k: usize = itr.next().unwrap().parse().unwrap();
    let s: usize = itr.next().unwrap().parse().unwrap();

    let mut ans: Vec<usize> = Vec::new();
    let max = 1_000_000_000;
    for _ in 0..k {
        ans.push(s);
    }
    for _ in 0..n - k {
        if s == max {
            ans.push(max - 1);
        } else {
            ans.push(max);
        }
    }
    let mut out = Vec::new();
    for i in 0..n {
        write!(out, "{}", ans[i]).ok();
        if i == n - 1 {
            writeln!(out, "").ok();
        } else {
            writeln!(out, " ").ok();
        }
    }
    stdout().write_all(&out).unwrap();
}