#include <bits/stdc++.h>
using namespace std;
inline void prep() {
  cin.tie(0);
  cin.sync_with_stdio(0);
};
const double pi = acos(-1.);
long long mod = 1000000007;
long long mymod(long long num) {
  if (num < 0 && !(num % mod == 0)) {
    if (mod == 1) {
      return 0;
    }
    return mod - abs(num) % mod;
  } else {
    return num % mod;
  }
}
const int biggg = 2000000000;
const long long bigggest = 1000000000000000000LL;
const double eps = .0000000001;
int main() {
  prep();
  long long n, p, w, d;
  cin >> n >> p >> w >> d;
  for (int i = 0; i <= 100000 && d * i <= p; i++) {
    long long mult = d * i;
    long long rem = p - mult;
    if (n - rem / w - i < 0) break;
    if (rem % w == 0) {
      cout << rem / w << " " << i << " " << n - rem / w - i;
      return 0;
    }
  }
  cout << -1;
  return 0;
}
