#include <bits/stdc++.h>
using namespace std;
long long n, p, w, d;
int main() {
  scanf("%lld%lld%lld%lld", &n, &p, &w, &d);
  long long resx = -1, resy = -1;
  for (long long y = 0; y <= w - 1; y++) {
    if (0 == (p - y * d) % w) {
      long long x = (p - y * d) / w;
      if (x >= 0 && y >= 0 && x + y <= n) resx = x, resy = y;
    }
  }
  if (-1 == resx && -1 == resy)
    printf("-1\n");
  else
    printf("%lld %lld %lld\n", resx, resy, n - resx - resy);
  return 0;
}
