#include <bits/stdc++.h>
using namespace std;
template <typename T>
T POW(T b, T p) {
  T r = 1;
  while (p) {
    if (p & 1) r = (r * b);
    b = (b * b);
    p >>= 1;
  }
  return r;
}
template <typename T>
T BigMod(T b, T p, T m) {
  T r = 1;
  while (p) {
    if (p & 1) r = (r * b) % m;
    b = (b * b) % m;
    p >>= 1;
  }
  return r;
}
int main() {
  long long n, x, y;
  while (cin >> n >> x >> y) {
    int keep = y / n;
    long long sum = 0;
    for (int i = 0; i < (n - 1); i++) sum += 1;
    sum += ((y - (n - 1)) * (y - (n - 1)));
    if (sum < x || (n > x && n > y)) {
      cout << "-1" << endl;
      continue;
    }
    for (int i = 0; i < (n - 1); i++) {
      cout << "1" << endl;
    }
    cout << y - (n - 1) << endl;
  }
}
