#include <bits/stdc++.h>
using namespace std;
bool po[100005];
int main() {
  long long n, p, w, d;
  cin >> n >> p >> w >> d;
  long long c = w - d;
  long long x = min(p / c, p / w);
  while (x >= max(0LL, (p - n * d) / c)) {
    if ((p - x * c) % d == 0) {
      long long y = (p - x * c) / d - x;
      cout << x << " " << y << " " << (n - x - y) << endl;
      return 0;
    }
    if (po[(p - x * c) % d]) {
      cout << -1 << endl;
      return 0;
    }
    po[(p - x * c) % d] = 1;
    --x;
  }
  cout << -1 << endl;
  return 0;
}
