#include <bits/stdc++.h>
using namespace std;
priority_queue<long long, vector<long long> > pq;
priority_queue<long long, vector<long long>, greater<long long> > pq1;
long long result(long long a, long long b, long long p) {
  long long ans = 1;
  if (b == (-1)) b = p - 2;
  while (b) {
    if (b & 1) {
      ans = (ans * a) % p;
    }
    a = (a * a) % p;
    b >>= 1;
  }
  return ans;
}
long long T = 1, n, m, k;
int main() {
  if (fopen("input.txt", "r"))
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long x, y;
  cin >> n >> x >> y;
  long long a[n];
  long long d = y / n;
  for (int i = 0; i < n - 1; i++) a[i] = 1;
  a[n - 1] = y - (n - 1);
  long long sum = 0;
  for (int i = 0; i < n; i++) {
    sum += a[i] * a[i];
  }
  if (sum < x || a[n - 1] <= 0)
    cout << "-1";
  else {
    for (int i = 0; i < n; i++) cout << a[i] << "\n";
  }
  return 0;
}
