#include <bits/stdc++.h>
using namespace std;
vector<vector<long long>> graph;
vector<long long> query;
vector<long long> ans;
vector<long long> visited;
const long long MAX_N = 1 << 17;
const long long MOD = 1000000007;
long long dat[2 * MAX_N - 1];
long long fact(long long n) {
  if (n == 1) return 1;
  return n * fact(n - 1);
}
long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  if (a % b == 0) return b;
  return gcd(b, a % b);
}
int main(void) {
  long long n, k, s;
  cin >> n >> k >> s;
  if (n == k) {
    for (long long i = 0; i < n; i++) {
      if (i < n - 1)
        cout << s << " ";
      else
        cout << s << endl;
    }
  } else {
    long long a, b;
    a = s / 2;
    b = a % 2 == 0 ? a : a + 1;
    for (long long i = 0; i < n; i++) {
      if (i <= k) {
        if (i < n - 1)
          cout << (i % 2 == 0 ? a : b) << " ";
        else
          cout << (i % 2 == 0 ? a : b) << endl;
      } else if (i < n - 1) {
        if (s < 1e9)
          cout << s + 1 << " ";
        else
          cout << s - 1 << " ";
      } else {
        if (s < 1e9)
          cout << s + 1 << endl;
        else
          cout << s - 1 << endl;
      }
    }
  }
}
