#include <bits/stdc++.h>
using namespace std;
map<int, int> ma;
int main() {
  long long n, p, w, d;
  cin >> n >> p >> w >> d;
  long long x, y, z = 0;
  for (long long i = 0;; i += d) {
    long long x = (p - i) / w;
    long long y = i / d;
    if (ma.count(i % w)) {
      cout << -1 << endl;
      break;
    }
    if (x * w + i == p) {
      if (x >= 0 && x + y <= n) {
        cout << x << " " << y << " " << (n - x - y) << endl;
      } else {
        cout << -1 << endl;
      }
      break;
    }
    ma[i % w]++;
  }
  return 0;
}
