#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MOD = 20010905;
const int maxn = 1e5 + 10;
int N, K, S, A[maxn];
int main() {
  scanf("%d %d %d", &N, &K, &S);
  for (int i = 1; i <= K; i++) A[i] = S;
  for (int i = K + 1; i <= N; i++) {
    if (S <= 1000000000 / 2)
      A[i] = 2 * S;
    else
      A[i] = i - K;
  }
  for (int i = 1; i <= N; i++) {
    if (i > 1) printf(" ");
    printf("%d", A[i]);
  }
  return 0;
}
