#include <bits/stdc++.h>
using namespace std;
int n, y, u;
long long x, sum;
int main() {
  cin >> n >> x >> y;
  u = sqrt(x);
  if (y < n || (u == y && n != 1) || x - (n - 1) > pow((y - n + 1), 2)) {
    cout << -1 << endl;
    return 0;
  }
  cout << y - n + 1 << endl;
  for (int i = 1; i < n; i++) cout << 1 << endl;
  return 0;
}
