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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.Scanner;


	public class Main {
		

		public static void main(String[] args) {

			Scanner sc = new Scanner(System.in);
	        
			int n = sc.nextInt();
			int k = sc.nextInt();
			int s = sc.nextInt();
			int a = 0;
			int b = 0;
			
			
			if(s%2==1) {
				a = s/2;
				b = a+1;
			}else {
				a = s/2;
				b = a;
			}
			int x =0;
			
			if(s==1000000000) {
				x=1;
			}else {
				x=s+1;
			}
			
			if(k==n) {
				for(int i=1;i<=n-1;i++) {
					System.out.print(s+" ");
				}
				System.out.print(s);
			}else {
				if(k%2==1) {
					for(int i=1;i<=(k+1)/2;i++) {
						System.out.print(a+" "+b+" ");
					}
					for(int i=1;i<n-k-1;i++) {
						System.out.print((x)+" ");
					}
					System.out.print((x));
				}else {
					for(int i=1;i<=k/2;i++) {
						System.out.print(a+" "+b+" ");
					}
					System.out.print(a+" ");
					for(int i=1;i<n-k-1;i++) {
						System.out.print((x)+" ");
					}
					System.out.print((x));
				}
			}
		}
		
	}