#include <bits/stdc++.h>
const int MAXN = 105;
int a[MAXN];
int main() {
  int n, m, l, i, j;
  scanf("%d%d%d", &n, &m, &l);
  for (i = 0; i < n; i++) a[i] = 1;
  int ans = 0;
  if (n & 1)
    ans = 1;
  else
    ans = 0;
  if (m > ans) {
    for (i = 0; i < n && m > ans; i += 2) {
      int t = m - ans;
      if (t > l - a[i]) {
        ans += l - a[i];
        a[i] = l;
      } else {
        ans = m;
        a[i] = t + 1;
      }
    }
  } else if (m < ans) {
    for (i = 1; i < n && m < ans; i += 2) {
      int t = ans - m;
      if (t >= l - a[i]) {
        ans -= l - a[i];
        a[i] = l;
      } else {
        ans = m;
        a[i] = t + 1;
      }
    }
  }
  if (ans != m)
    printf("-1\n");
  else {
    for (i = 0; i < n; i++) {
      if (i) printf(" ");
      printf("%d", a[i]);
    }
    printf("\n");
  }
  return 0;
}
