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 Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.util.*;

public class Main {
    public static void main(String[] args) throws Exception {
        // Your code here!
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int k = sc.nextInt();
        int s = sc.nextInt();
        
        if (k == 0) {
            for (int i = 0; i < n; i++) {
                if (s == 1000000000) {
                    System.out.print(2);
                } else {
                    System.out.print(s+1);
                }
                if (i != n - 1) {
                    System.out.print(" ");
                } else {
                    System.out.println();
                return;
                }
            }
        }
        
        int[] array = new int[n];
        
        for (int i = 0; i < k - 1; i++) {
            array[i] = s;
        }
        
        int tmp = n - (k - 1);
        boolean komaru = false;
        if (tmp > s) {
            komaru = true;
        }
        
        
        if (tmp == s) {
            for (int i = k - 1; i < n; i++) {
                array[i] = 1;
            }
            
            for (int i = 0; i < n; i++) {
                System.out.print(array[i]);
                if (i != n - 1) {
                    System.out.print(" ");
                } else {
                    System.out.println();
                return;
                }
            }
        }
        
        if (komaru) {
            for (int i = k - 1; i < n - 1; i++) {
                if (s == 1000000000) {
                    array[i] = 2;
                } else {
                    array[i] = s + 1;
                }
            }
            array[n - 1] = s;
            
            for (int i = 0; i < n; i++) {
                System.out.print(array[i]);
                if (i != n - 1) {
                    System.out.print(" ");
                } else {
                    System.out.println();
                return;
                }
            }
        } else {
            for (int i = k - 1; i < n - 1; i++) {
                array[i] = 1;
            }
            array[n - 1] = s - (n - k);
            
            for (int i = 0; i < n; i++) {
                System.out.print(array[i]);
                if (i != n - 1) {
                    System.out.print(" ");
                } else {
                    System.out.println();
                return;
                }
            }
        }
    }
}