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.util.*;

class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = Integer.parseInt(sc.next());
    int k = Integer.parseInt(sc.next());
    int s = Integer.parseInt(sc.next());
    int[] a = new int[n];
    int p = 0;

    if(n==k){
      for(int i=0; i<n; i++){
        System.out.print(s);
        System.out.print(" ");
      }
      System.out.print("\n");
      return;
    } else {
      if(s==1){
        for(int i=0; i<n; i++){
          if(i<k){
            System.out.print(1);
            System.out.print(" ");
          } else {
            System.out.print(9);
            System.out.print(" ");
          }
        }
      } else {
        for(int i=0; i<n; i++){
          if(i<=k){
            if(i%2 == 1){
              System.out.print(1);
              System.out.print(" ");
            } else {
              System.out.print(s-1);
              System.out.print(" ");
            }
          } else {
            System.out.print(888888888);
            System.out.print(" ");
          }
        }
      }
      System.out.print("\n");
      return;
    }

  }
}