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 C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

class C {
    static void Main(string[] args) {
        var st = Console.ReadLine().Split(' ').Select(int.Parse).ToArray();

        int N = st[0];
        int K = st[1];
        int S = st[2];

        int[] ans = new int[N];

        int l = 0;

        if (S == 2) {
            l = 2;
        } else {
            l = 1;
        }



        if (K <= N / 2) {
            //K組の(S - 1, 1),(1, S - 1),(S - 1, 1)...を並べて、残りは全てS + 1にする
            for (int i = 0; i < N; i++) {
                if (i >= K * 2) {
                    ans[i] = S + l;
                } else if (i % 4 == 0 || i % 4 == 3) {
                    ans[i] = S - l;
                } else {
                    ans[i] = l;
                }
            }
        } else {
            //K - (K / 2)組の(S - 1, 1),(S - 1, 1)...を並べて、
            //重複組の組数
            int chofuku = K - (N / 2) + 1;

            //Console.WriteLine(chofuku);
            for (int i = 0; i < N; i++) {
                if (i < chofuku * 2) {
                    if (i % 2 == 0) {
                        ans[i] = S - l;
                    } else {
                        ans[i] = l;
                    }
                } else {
                    if ((i - chofuku * 2) % 4 == 0 || (i - chofuku * 2) % 4 == 3) {
                        ans[i] = l;
                    } else {
                        ans[i] = S - l;
                    }
                }
            }

            if (N % 2 == 1) {
                ans[N - 1] = S + 1;
            }
        }

        Console.WriteLine(string.Join(" ", ans));

    }
}