#include <bits/stdc++.h>
const long long INF = 99999999999999;
const long long MOD = 1000000007;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long number1, long long number2) {
  return number1 * number2 / gcd(number1, number2);
}
template <class T>
bool contain(const std::string &s, const T &v) {
  return s.find(v) != std::string::npos;
}
int ctoi(char c) {
  if (c >= '0' && c <= '9') return c - '0';
  return 0;
}
using namespace std;
int main() {
  long long n, k, s;
  cin >> n >> k >> s;
  if (s == 1) {
    for (long long(i) = 0; (i) < (k); (i)++) {
      cout << 1 << " ";
    }
    for (long long(i) = 0; (i) < (n - k); (i)++) {
      cout << 2 << " ";
    }
  } else {
    for (long long(i) = 0; (i) < (k); (i)++) {
      cout << s << " ";
    }
    for (long long(i) = 0; (i) < (n - k); (i)++) {
      cout << 1 << " ";
    }
  }
  return 0;
}
