#include <bits/stdc++.h>
using namespace std;
long long int INF = 3e18;
const long long fact_table = 800008;
double Pi = 3.1415926535897932384626;
priority_queue<long long> pql;
priority_queue<pair<long long, long long> > pqp;
priority_queue<long long, vector<long long>, greater<long long> > pqls;
long long dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
long long dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
char dir[] = "DRUL";
long long mod = 1000000007;
long long rui(long long number1, long long number2) {
  if (number2 == 0) {
    return 1;
  } else {
    long long number3 = rui(number1, number2 / 2);
    number3 *= number3;
    number3 %= mod;
    if (number2 % 2 == 1) {
      number3 *= number1;
      number3 %= mod;
    }
    return number3;
  }
}
long long gcd(long long number1, long long number2) {
  if (number1 > number2) {
    swap(number1, number2);
  }
  if (number1 == 0 || number1 == number2) {
    return number2;
  } else {
    return gcd(number2 % number1, number1);
  }
}
void YES(bool condition) {
  if (condition) {
    cout << "YES"
         << "\n";
    ;
  } else {
    cout << "NO"
         << "\n";
    ;
  }
  return;
}
void Yes(bool condition) {
  if (condition) {
    cout << "Yes"
         << "\n";
    ;
  } else {
    cout << "No"
         << "\n";
    ;
  }
  return;
}
long long n, m, num, sum, a, b, c, d, e, g, h, w, i, j, q, r, l;
long long k;
long long ans;
long long x[500005], y[200005], z[200005];
char s[500005], t[500005];
bool used[3005][3004];
pair<long long, long long> table[500005];
int main() {
  long long s;
  cin >> n >> k >> s;
  if (s == 1) {
    for (long long i = 0; i < k; i++) {
      cout << (1) << " ";
      ;
    }
    for (long long i = k; i < n; i++) {
      cout << (2) << " ";
      ;
    }
    cout << endl;
    ;
    return 0;
  }
  long long one = n - k;
  for (long long i = 0; i < k; i++) {
    cout << (s) << " ";
    ;
    if (one > 0) {
      one--;
      cout << (1) << " ";
      ;
    }
  }
  cout << endl;
  ;
  return 0;
}
