#include <bits/stdc++.h>
int diru[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dirv[] = {-1, 0, 1, -1, 1, -1, 0, 1};
using namespace std;
template <class T>
T sq(T n) {
  return n * n;
}
template <class T>
T gcd(T a, T b) {
  return (b != 0 ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(T a, T b) {
  return (a / gcd<T>(a, b) * b);
}
template <class T>
bool inside(T a, T b, T c) {
  return a <= b && b <= c;
}
template <class T>
void setmax(T &a, T b) {
  if (a < b) a = b;
}
template <class T>
void setmin(T &a, T b) {
  if (b < a) a = b;
}
template <class T>
T power(T N, T P) {
  return (P == 0) ? 1 : N * power(N, P - 1);
}
int main() {
  long long unsigned n, T, t = 1, m, i, j, k, x, y;
  while (cin >> n) {
    cin >> x >> y;
    if (n > y) {
      printf("-1\n");
      continue;
    }
    long long unsigned tot = 0;
    long long unsigned p = y;
    for (i = 0; i < n - 1; i++) {
      tot += 1;
      p--;
    }
    tot += p * p;
    if (tot >= x) {
      p = y;
      for (i = 0; i < n - 1; i++) {
        printf("1\n");
        p--;
      }
      printf("%llu\n", p);
    } else
      printf("-1\n");
  }
  return 0;
}
