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.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in Actual solution is at the top
 *
 * @author Silviase
 */
public class Main {

  public static void main(String[] args) {
    InputStream inputStream = System.in;
    OutputStream outputStream = System.out;
    Scanner in = new Scanner(inputStream);
    PrintWriter out = new PrintWriter(outputStream);
    KEYENCE2020C solver = new KEYENCE2020C();
    solver.solve(1, in, out);
    out.close();
  }

  static class KEYENCE2020C {

    public void solve(int testNumber, Scanner in, PrintWriter out) {
      int n = in.nextInt();
      int k = in.nextInt();
      int s = in.nextInt();
      int[] ar = new int[n];
      StringBuilder sb = new StringBuilder();
      if (s == 1000000000) {
        for (int i = 0; i < n; i++) {
          if (i < k) {
            ar[i] = s;
          } else {
            ar[i] = s - 1;
          }
        }
      } else {
        for (int i = 0; i < n; i++) {
          if (i < k) {
            ar[i] = s;
          } else {
            ar[i] = s + 1;
          }
        }
      }

      for (int i = 0; i < n; i++) {
        sb.append(ar[i]);
        sb.append(" ");
      }
      out.println(new String(sb));

    }

  }
}