#include <bits/stdc++.h>
using namespace std;
template <class T>
T sq(T x) {
  return x * x;
}
const long long inf = 2147383647;
const double pi = 2 * acos(0.0);
const double eps = 1e-9;
const long long maxint = 2147483647;
const long long minint = -2147483648;
long long gcd(long long a, long long b) {
  while (b) {
    a = a % b;
    swap(a, b);
  }
  return a;
}
long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
long long power(long long a, long long p) {
  long long res = 1, x = a;
  while (p) {
    if (p & 1) res = res * x;
    x = x * x;
    p >>= 1;
  }
  return res;
}
long long bigmod(long long a, long long p, long long mod) {
  long long res = 1, x = a;
  while (p) {
    if (p & 1) res = (res * x) % mod;
    x = (x * x) % mod;
    p >>= 1;
  }
  return res;
}
int main() {
  long long n, x, y;
  scanf("%I64d %I64d %I64d", &n, &x, &y);
  long long first = y - (n - 1);
  if (first <= 0) {
    printf("-1\n");
    return 0;
  }
  long long mx = (first * first) + (n - 1);
  if (mx < x) {
    printf("-1\n");
    return 0;
  }
  printf("%I64d\n", first);
  for (int i = 1; i < n; i++) printf("1\n");
  return 0;
}
