#include <bits/stdc++.h>
using namespace std;
bool fun(int a[], int n, int k, int x, int p) {
  int l = 0;
  for (int i = 0; i < n; i++) {
    if (p) {
      l++;
      p = !p;
    } else if (a[i] <= x) {
      l++;
      p = !p;
    }
    if (l >= k) return 1;
  }
  return 0;
}
void sol() {
  long long int n, p, w, d, x, y, k;
  cin >> n >> p >> w >> d;
  if (p > n * w || (p && p < d)) {
    printf("-1");
    return;
  }
  if (p % w == 0) {
    printf("%lld ", p / w);
    printf("0 ");
    printf("%lld ", n - (p / w));
    return;
  }
  k = -1;
  for (int i = 0; i < d; i++) {
    if (p % d == (i * (w % d)) % d) {
      k = i;
      break;
    }
  }
  if (k == -1) {
    printf("%lld ", k);
    printf("\n");
    return;
  }
  x = p / w;
  if (k <= x % d)
    x = x - x % d + k;
  else
    x = x - x % d - ((d - k) % d);
  y = (p - (x * w)) / d;
  printf("%lld ", x);
  printf("%lld ", y);
  printf("%lld ", n - (x + y));
  printf("\n");
}
int main() { sol(); }
