#include <bits/stdc++.h>
const long long mod = 1e9 + 7;
const long long INF = 0x3f3f3f3f;
const int maxn = 1e5 + 5;
const double pi = acos(-1.0);
using namespace std;
long long qpow(long long a, long long b) {
  long long s = 1;
  while (b > 0) {
    if (b & 1) s = s * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return s;
}
long long read() {
  long long res = 0, ch, flag = 0;
  if ((ch = getchar()) == '-')
    flag = 1;
  else if (ch >= '0' && ch <= '9')
    res = ch - '0';
  while ((ch = getchar()) >= '0' && ch <= '9') res = res * 10 + ch - '0';
  return flag ? -res : res;
}
int main() {
  long long n, k, s;
  long long x, y;
  cin >> n >> k >> s;
  for (int i = 0; i < n; i++) {
    if (i % 2 == 0)
      cout << s << endl;
    else
      cout << "1" << endl;
  }
  cout << endl;
}
