#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fll;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, d, l;
  cin >> n >> d >> l;
  vector<int> mi(n + 1), ma(n + 1);
  mi[1] = 1, ma[1] = l;
  for (int i = 2; i <= n; i++) {
    mi[i] = 1 - ma[i - 1];
    ma[i] = l - mi[i - 1];
  }
  if (d < mi[n] or d > ma[n]) return cout << -1 << '\n', 0;
  vector<int> ans(n);
  for (int i = 0; i < n; i += 2) ans[i] = 1;
  for (int i = 1; i < n; i += 2) ans[i] = l;
  while (1) {
    int at = 0;
    for (int i = 0; i < n; i += 2) at += ans[i];
    for (int i = 1; i < n; i += 2) at -= ans[i];
    if (at == d) break;
    bool fez = 0;
    for (int i = 0; i < n; i += 2)
      if (ans[i] < l) {
        ans[i]++;
        fez = 1;
        break;
      }
    if (fez) continue;
    for (int i = 1; i < n; i += 2)
      if (ans[i] > 1) {
        ans[i]--;
        break;
      }
  }
  for (int i : ans) cout << i << " ";
  cout << '\n';
  exit(0);
}
