#include <bits/stdc++.h>
using namespace std;
const int N = 30003;
int main() {
  long long n, p, d, w;
  cin >> n >> p >> w >> d;
  for (int i = 0; i < min(n + 1, w); i++) {
    long long remP = p - i * d;
    if (remP < 0) break;
    long long remMatches = n - i;
    if (remP % w) continue;
    if (remP / w <= remMatches)
      return cout << remP / w << " " << i << " " << n - i - remP / w, 0;
  }
  cout << -1;
  return 0;
}
