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: Wrong Answer)

package main

import (
	"fmt"
	"strconv"
	"strings"
)

const nMax = 100000 // 10^5

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

	w := make([]string, 0)
	c := 0
	aa := false
	for i := 0; len(w) < n; i++ {
		if c < k {
			t := s
			if nMax < t {
				for j := 0; j < t/nMax; j++ {
					w = append(w, strconv.Itoa(nMax))
				}
				if aa && t/nMax > 1 {
					w = w[:len(w)-1]
					aa = false
				} else {
					if t%nMax != 0 {
						w = append(w, strconv.Itoa(t%nMax))
						i++
						aa = true
					} else {
						aa = false
					}
				}
			} else {
				w = append(w, strconv.Itoa(t))
			}
		} else {
			t := s - 1
			if t+1 == s {
				t = nMax/2 - 3
			}
			if t < 0 {
				t = s + 1
			} else if nMax < t {
				t = 1
			}
			w = append(w, strconv.Itoa(t))
		}
		c++
	}

	fmt.Println(strings.Join(w, " "))
}