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: Accepted)

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

namespace keyence2020_C
{
    class Program
    {
        static void Main(string[] args)
        {
            var nks = Console.ReadLine().Split().Select(long.Parse).ToArray();
            var n = nks[0];
            var k = nks[1];
            var s = nks[2];

            var ans = new long[n];
            var numS = 0;
            if (n == k)
            {
                for (int i = 0; i < n; i++)
                {
                    ans[i] = s;
                }
            }
            else if (k == 0)
            {
                var num = s == 1000000000 ? 1000000000 - 1 : 1000000000;
                for (int i = 0; i < n; i++)
                {
                    ans[i] = num;
                }
            }
            else if (s == 1)
            {
                for (int i = 0; i < k; i++)
                {
                    ans[i] = 1;
                }
                for (int i = (int)k; i < n; i++)
                {
                    ans[i] = 100;
                }
            }
            else
            {
                var a = s % 2 == 0 ? s / 2 : s / 2;
                var b = s % 2 == 0 ? s / 2 : s / 2 + 1;
                var c = 0;
                for (int i = 0; i < n; i++)
                {
                    ans[i] = i % 2 == 0 ? a : b;
                    if (i > 0) numS++;

                    if (k - numS == 0)
                    {
                        c = i;
                        break;
                    }
                }

                if (c == n - 1)
                {

                }
                else if (s < 1000000000)
                {
                    for (int i = c + 1; i < n; i++)
                    {
                        ans[i] = s + 1;
                    }
                }
                else
                {
                    ans[c] = c % 2 == 0 ? a + 1 : b + 1;

                    var rest = s - ans[c];
                    for (int i = c + 1; i < n - 1; i++)
                    {
                        ans[i] = 1;
                        rest--;
                    }
                    ans[n - 1] = rest;
                }
            }

            Console.WriteLine(string.Join(" ", ans.Select(x => x.ToString()).ToArray()));
        }
    }
}