#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string &s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
  bool first = true;
  string ret = "{";
  for (long long i = 0; i < static_cast<long long>(v.size()); i++) {
    if (!first) {
      ret += ", ";
    }
    first = false;
    ret += to_string(v[i]);
  }
  ret += "}";
  return ret;
}
template <size_t N>
string to_string(bitset<N> v) {
  string ret = "";
  for (size_t i = 0; i < N; i++) {
    ret += static_cast<char>('0' + v[i]);
  }
  return ret;
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string ret = "{";
  for (const auto &x : v) {
    string s = to_string(x);
    if (!first) {
      ret += ", ";
    }
    if (s[0] == '{') {
      s = "\n" + s;
    }
    first = false;
    ret += s;
  }
  if (ret[ret.size() - 1] == '}') {
    ret += "\n}";
  } else {
    ret += "}";
  }
  return ret;
}
template <typename A, typename... Lest>
string to_string(A *v, long long n, Lest... L) {
  bool first = true;
  string ret = "{";
  for (long long i = 0; i < n; i++) {
    auto x = v[i];
    string s = to_string(x, L...);
    if (!first) {
      ret += ", ";
    }
    if (s[0] == '{') {
      s = "\n" + s;
    }
    first = false;
    ret += s;
  }
  if (ret[ret.size() - 1] == '}') {
    ret += "\n}";
  } else {
    ret += "}";
  }
  return ret;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void name_disp(string s) {
  cerr << "-------" << endl;
  cerr << s << ": " << endl;
}
void val_disp() { cerr << endl; }
template <typename First, typename... Lest>
void val_disp(First F, Lest... L) {
  cerr << to_string(F) << endl;
  val_disp(L...);
}
template <typename A, typename... Lest>
void val_disp(A *v, Lest... L) {
  cerr << to_string(v, L...) << endl;
  val_disp();
}
const long long INF = 1000000000;
const long long M = 100000000;
const long long dir_4[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
const long long dir_8[8][2] = {{1, 0},  {1, 1},   {0, 1},  {-1, 1},
                               {-1, 0}, {-1, -1}, {0, -1}, {1, -1}};
signed main() {
  long long n, k, s;
  scanf("%lld%lld%lld", &n, &k, &s);
  if (n == k) {
    bool first = true;
    for (long long i = 0; i < n; i++) {
      if (!first) {
        printf(" ");
      }
      first = false;
      printf("%lld", s);
    }
    printf("\n");
    return 0;
  } else if (k < n) {
    if (s % 2 == 0) {
      long long ret = s / 2;
      bool first = true;
      for (long long i = 0; i < k + 1; i++) {
        if (!first) {
          printf(" ");
        }
        first = false;
        printf("%lld", ret);
      }
      long long nokori = n - (k + 1);
      for (long long i = 0; i < nokori; i++) {
        if (!first) {
          printf(" ");
        }
        first = false;
        if (s == INF) {
          printf("%lld", 1ll);
        } else {
          printf("%lld", INF);
        }
      }
      printf("\n");
      return 0;
    } else {
      long long ret[2] = {s / 2, s / 2 + 1};
      bool first = true;
      for (long long i = 0; i < k + 1; i++) {
        if (!first) {
          printf(" ");
        }
        first = false;
        printf("%lld", ret[i % 2]);
      }
      long long nokori = n - (k + 1);
      for (long long i = 0; i < nokori; i++) {
        if (!first) {
          printf(" ");
        }
        first = false;
        printf("%lld", INF);
      }
      printf("\n");
      return 0;
    }
  }
  return 0;
};
