#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, p, x = 0, w, d, y = 0, z = 0, cp = 0;
  cin >> n >> p >> w >> d;
  if (n * w < p) {
    cout << -1;
    exit(0);
  } else {
    if (p % w == 0) {
      x = p / w;
      y = 0;
      z = n - x - y;
    } else {
      cp = 1;
      bool flag = 0, flag1 = 0;
      map<long long, bool> y1;
      while (p - cp * d > 0) {
        if (y1[(p - cp * d) % w] == true) break;
        if ((p - cp * d) % w == 0) {
          x = (p - cp * d) / w;
          y = cp;
          z = (n - x - y);
          flag = 1;
          break;
        }
        y1[(p - cp * d) % w] = true;
        cp++;
      }
      if (flag == 0) {
        if (p % d == 0 && n * d >= p) {
          x = 0;
          y = p / d;
          z = n - x - y;
          flag = 1;
        }
      }
      if (flag == 0) {
        cout << -1;
        exit(0);
      }
    }
    cout << x << " " << y << " " << z;
  }
}
