#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
void solve() {
  int n, k, s;
  cin >> n >> k >> s;
  for (int i = 0; i < (k); ++i) cout << s << " ";
  int prev = s;
  for (int i = 0; i < (n - k); ++i) {
    if (prev == INF) {
      cout << i + 1 << " ";
    } else {
      ++prev;
      cout << prev << " ";
    }
  }
  cout << endl;
}
int main() {
  solve();
  return 0;
}
