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 Scala (2.11.7) (judge verdict: Accepted)

import java.util.Scanner

object Main {
  def main(args: Array[String]): Unit = {
    //nextLineとnextを同時に使ったら死ぬ
    val sc = new Scanner(System.in)
    val n, k, s = sc.nextLong()
    s match {
      case 1000000000L =>
        print(Array.fill(k.toInt)(s).mkString(" "))
        if ((n - k) > 0) {
          print(" ")
          print(Array.fill((n - k).toInt)(1).mkString(" "))
          println()
        } else {
          println()
        }
      case _ =>
        print(Array.fill(k.toInt)(s).mkString(" "))
        if ((n - k) > 0) {
          print(" ")
          print(Array.fill((n - k).toInt)(1000000000).mkString(" "))
          println()
        } else {
          println()
        }
    }
  }
}