#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b, long long int &x,
                  long long int &y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  long long int x1, y1;
  long long int d = gcd(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return d;
}
bool find_any_solution(long long int a, long long int b, long long int c,
                       long long int &x0, long long int &y0, long long int &g) {
  cout << a << " " << b << " " << c << endl;
  g = gcd(abs(a), abs(b), x0, y0);
  if (c % g) {
    return false;
  }
  long long int aux1 = c / g;
  x0 = x0 * aux1;
  y0 = y0 * aux1;
  if (a < 0) x0 = -x0;
  if (b < 0) y0 = -y0;
  return true;
}
int main() {
  long long int n, p, w, d, x, y, k1, k2, k3, g;
  cin >> n >> p >> w >> d;
  for (int y = 0; y < w; y++) {
    if ((p - y * d) >= 0 && (p - y * d) % w == 0 &&
        ((p - y * d) / w + y) <= n) {
      cout << (p - y * d) / w << " " << y << " " << n - y - (p - y * d) / w
           << endl;
      return 0;
    }
  }
  cout << -1 << endl;
  return 0;
}
