Problem: 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

Output

Print a sequence satisfying the condition, in the following format:


A_1 A_2 ... A_N

Examples

Input

4 2 3


Output

1 2 3 4


Input

5 3 100


Output

50 50 50 30 70

Solution (in JAVA):

Solution:

import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
import java.util.*;

public class Main {

	public static void main(String[] args) throws NumberFormatException, IOException {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		Task solver = new Task();
		int i = 0;
//		int t = in.nextInt();
//		for (; i < t; i++)
		solver.solve(i, in, out);

		out.close();

	}

	static class Task {
		static ArrayList<ArrayList<Integer>> adj;
		static ArrayList<Boolean> visited;

		static int hash(ArrayList<Integer> al) {
			int cur = 0;
			for (Integer i : al) {
				cur += (cur * 300001) + i;
			}
			return cur + al.size();
		}

		static int merge(int arr[], int temp[], int left, int mid, int right) {
			int inv_count = 0;

			/* i is index for left subarray */
			int i = left;

			/* i is index for right subarray */
			int j = mid;

			/* i is index for resultant merged subarray */
			int k = left;

			while ((i <= mid - 1) && (j <= right)) {
				if (arr[i] <= arr[j])
					temp[k++] = arr[i++];
				else {
					temp[k++] = arr[j++];

					/*
					 * this is tricky -- see above / explanation diagram for merge()
					 */
					inv_count = inv_count + (mid - i);
				}
			}

			/*
			 * Copy the remaining elements of left subarray (if there are any) to temp
			 */
			while (i <= mid - 1)
				temp[k++] = arr[i++];

			/*
			 * Copy the remaining elements of right subarray (if there are any) to temp
			 */
			while (j <= right)
				temp[k++] = arr[j++];

			/*
			 * Copy back the merged elements to original array
			 */
			for (i = left; i <= right; i++)
				arr[i] = temp[i];

			return inv_count;
		}

		// An auxiliary recursive function that
		// sorts the input array and returns
		// the number of inversions in the array.
		static int _mergeSort(int arr[], int temp[], int left, int right) {
			int mid, inv_count = 0;
			if (right > left) {
				// Divide the array into two parts and
				// call _mergeSortAndCountInv() for
				// each of the parts
				mid = (right + left) / 2;

				/*
				 * Inversion count will be sum of inversions in left-part, right-part and number
				 * of inversions in merging
				 */
				inv_count = _mergeSort(arr, temp, left, mid);

				inv_count += _mergeSort(arr, temp, mid + 1, right);

				/* Merge the two parts */
				inv_count += merge(arr, temp, left, mid + 1, right);
			}

			return inv_count;
		}

		// This function sorts the input
		// array and returns the number
		// of inversions in the array
		static double countSwaps(int arr[], int n) {
			int temp[] = new int[n];
			return _mergeSort(arr, temp, 0, n - 1);
		}

		public void solve(int testNumber, InputReader in, PrintWriter out) {
			int n = in.nextInt();
			int k = in.nextInt();
			int s = in.nextInt();
			if (s != 1) {
				for (int i = 0; i < k; i++) {
					System.out.print(s+" ");
				}
				for (int i = 0; i < n-k; i++) {
					System.out.print(s-1+" ");
				}
			}else {
				for (int i = 0; i < k; i++) {
					System.out.print(s+" ");
				}
				for (int i = 0; i < n-k; i++) {
					System.out.print(s+1+" ");
				}
			}

		}

		public static void dfs(int v) {
			visited.set(v - 1, true);
			for (Integer i : adj.get(v - 1)) {
				if (!visited.get(i - 1))
					dfs(i - 1);
			}
		}

		static long modInverse(long a, int m) {
			long g = gcd(a, m);
			if (g != 1) {
				System.out.println("Inverse doesn't exist");
				return 0;
			} else {
				// If a and m are relatively prime, then modulo inverse
				// is a^(m-2) mode m
				return power(a, m - 2, m);
			}
		}

		// To compute x^y under modulo m
		static long power(long x, long y, long m) {
			if (y == 0)
				return 1;

			long p = power(x, y / 2, m) % m;
			p = (p * p) % m;

			if (y % 2 == 0)
				return p;
			else
				return (x * p) % m;
		}

		// Function to return gcd of a and b
		static long gcd(long a, long b) {
			if (a == 0)
				return b;
			return gcd(b % a, a);
		}

		static int highestPowerOf2(int n) {
			return (n & (~(n - 1)));
		}

	}
	// template code

	static class InputReader {
		public BufferedReader reader;
		public StringTokenizer tokenizer;

		public InputReader(InputStream stream) {
			reader = new BufferedReader(new InputStreamReader(stream), 32768);
			tokenizer = null;
		}

		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(next());
		}

		public long nextLong() {
			return Long.parseLong(next());
		}

		public double nextDouble() {
			return Double.parseDouble(next());
		}

	}

}

class Point {
	double x, y;

	public Point(double x, double y) {
		this.x = x;
		this.y = y;
	}

	public double d(Point p2) {

		return Math.sqrt(Math.pow(p2.x - this.x, 2) + Math.pow(p2.y - this.y, 2));
	}

	public Point mp(Point p2) {
		return new Point((p2.x + this.x) / 2, (p2.y + this.y) / 2);
	}
}

class TCS implements Comparable<TCS>, Comparator<TCS> {
	long i1, i2;
	int flag;

	@Override
	public String toString() {
		// TODO Auto-generated method stub
		return "i1:" + i1 + "  i2:" + i2;
	}

	TCS(long i1, long i2) {
		this.i1 = i1;
		this.i2 = i2;
	}

	@Override
	public int compareTo(TCS o) {
		// TODO Auto-generated method stub
		return compare(this, o);
	}

	@Override
	public int compare(TCS o1, TCS o2) {
		// TODO Auto-generated method stub
		return (int) ((o1.i1 == o2.i1) ? o1.i2 - o2.i2 : o1.i1 - o2.i1);
	}

	@Override
	public int hashCode() {
		// TODO Auto-generated method stub
		return super.hashCode();
	}

	@Override
	public boolean equals(Object obj) {
		// TODO Auto-generated method stub
		return super.equals(obj);
	}

}

class Pair implements Comparator<Pair>, Comparable<Pair> {
	int key, value;

	@Override
	public String toString() {
		// TODO Auto-generated method stub
		return "key:" + key + " value: " + value;
	}

	public Pair(int i, int j) {
		key = i;
		value = j;

	}

	@Override
	public int compare(Pair o1, Pair o2) {
		// TODO Auto-generated method stub
		return o1.compareTo(o2);
	}

	@Override
	public int hashCode() {
		// TODO Auto-generated method stub
		return key;
	}

	@Override
	public int compareTo(Pair o) {
		// TODO Auto-generated method stub
		return this.key - o.key;
	}

}