#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int n, k;
double a[maxn], sum[maxn];
struct node {
  int l, r;
} p[maxn << 1];
bool cmp(node x, node y) { return x.l < y.l; }
const int N = 15;
int dp[N][N][N][N], d[N][N];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long s, inf;
  inf = 1000000000000;
  cin >> n >> k >> s;
  for (long long i = 1; i <= k; i++) cout << s << ' ';
  for (long long i = k + 1; i <= n; i++) cout << inf << ' ';
}
