#include <bits/stdc++.h>
using namespace std;
long long int MAX = 10000;
long long int INF = 0x3f3f3f3f;
vector<pair<long long int, long long int> > vi[10005];
long long int d[10005];
int main() {
  long long int n, x, y, s, i, count = 0;
  vector<long long int> vi;
  cin >> n >> x >> y;
  if ((n > y) || (n == y && n != x)) {
    cout << -1;
  } else {
    for (i = 1; i < n; i++) {
      vi.push_back(1);
    }
    s = y - (n - 1);
    vi.push_back(s);
    for (i = 0; i < n; i++) {
      s = vi[i] * 1ll * vi[i];
      count += s;
    }
    if (count < x) {
      cout << -1;
    } else {
      for (i = 0; i < n; i++) {
        cout << vi[i] << " ";
      }
    }
  }
}
