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 Go (1.6) (judge verdict: Accepted)

package main

import (
	"fmt"
	"math"
)

func main() {
	var n, k, s int
	fmt.Scan(&n)
	fmt.Scan(&k)
	fmt.Scan(&s)

	// S=10**9のとき
	// A1からAKを10**9とし、残りを1で埋めればよい
	// S/=10**9のとき
	// 左側でK通り作ったら、右側はS+1で埋めればよい
	// 左側でK通り作るにはどうすればいいか
	// A1からAKをSにすればOK?
	if s == int(math.Pow(10, 9)) {
		for i := 0; i < k; i++ {
			fmt.Print(s)
			fmt.Print(" ")
		}
		for i := 0; i < n-k-1; i++ {
			fmt.Print(1)
			fmt.Print(" ")
		}
		if n > k {
			fmt.Println(1)
		}
	} else {
		for i := 0; i < k; i++ {
			fmt.Print(s)
			fmt.Print(" ")
		}
		for i := 0; i < n-k-1; i++ {
			fmt.Print(s + 1)
			fmt.Print(" ")
		}
		if n > k {
			fmt.Println(s + 1)
		}
	}
}

func scanNums(len int) (nums []int) {
	var num int
	var i int
	for i = 0; i < len; i++ {
		fmt.Scan(&num)
		nums = append(nums, num)
	}
	return
}