#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
int gcd(int u, int v) { return v ? gcd(v, u % v) : u; }
int main() {
  long long n, x, y;
  cin >> n >> x >> y;
  if (n - 1 + (y - n + 1) * (y - n + 1) >= x && y - n + 1 > 0) {
    cout << y - n + 1 << endl;
    for (long long i = (long long)(0); i < (long long)(n - 1); ++i)
      printf("1\n");
  } else
    cout << -1 << endl;
  return 0;
}
