#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
long long keta(long long n) {
  string s = to_string(n);
  long long num = s.size();
  return num;
}
const long long INF = 1LL << 60;
const int dh[4] = {1, 0, -1, 0};
const int dw[4] = {0, 1, 0, -1};
struct Edge {
  int to;
  int weight;
  Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
using P = pair<long long, int>;
class UnionFind {
 public:
  vector<int> Parent;
  UnionFind(int n) { Parent = vector<int>(n, -1); }
  int root(int a) {
    if (Parent[a] < 0)
      return a;
    else
      return Parent[a] = root(Parent[a]);
  }
  int size(int a) { return -Parent[root(a)]; }
  bool merge(int a, int b) {
    a = root(a);
    b = root(b);
    if (a == b) return false;
    if (size(a) < size(b)) swap(a, b);
    Parent[a] += Parent[b];
    Parent[b] = a;
    return true;
  }
};
class Factrial {
 public:
  vector<long long> Fac;
  Factrial(int MAX) {
    Fac = vector<long long>(MAX + 1);
    for (int i = 0; i < MAX; i++) {
      if (i == 0)
        Fac[i + 1] = 1;
      else
        Fac[i + 1] = ((i + 1) * Fac[i]) % (1000000007);
    }
  }
};
int main() {
  int n, k, s;
  cin >> n >> k >> s;
  vector<int> ans(n);
  if (s < 1e9) {
    for (int i = 0; i < n; i++) ans[i] = 1e9;
  } else {
    for (int i = 0; i < n; i++) ans[i] = 1e9 - 1;
  }
  ans[0] = s;
  int i = 1;
  while (k != 1) {
    ans[i] = 0;
    i++;
    k--;
  }
  for (int i = 0; i < n; i++) cout << ans[i] << endl;
}
