#include <bits/stdc++.h>
using namespace std;
const int mx = 1e5 + 10;
const double eps = 1e-9;
const int inf = 1e9;
char a[2000];
int main() {
  long long n, p;
  int w, d;
  scanf("%lld%lld%d%d", &n, &p, &w, &d);
  for (int i = 0; i <= mx; i++) {
    long long tmp = 1ll * i * d;
    if (tmp > p) break;
    if ((p - tmp) % w == 0) {
      long long win = (p - tmp) / w;
      long long los = i;
      if (win + los <= n) {
        printf("%lld %lld %lld", win, los, n - win - los);
        return 0;
      }
    }
  }
  printf("-1");
}
