The football season has just ended in Berland. According to the rules of Berland football, each match is played between two teams. The result of each match is either a draw, or a victory of one of the playing teams. If a team wins the match, it gets w points, and the opposing team gets 0 points. If the game results in a draw, both teams get d points.

The manager of the Berland capital team wants to summarize the results of the season, but, unfortunately, all information about the results of each match is lost. The manager only knows that the team has played n games and got p points for them.

You have to determine three integers x, y and z — the number of wins, draws and loses of the team. If there are multiple answers, print any of them. If there is no suitable triple (x, y, z), report about it.

Input

The first line contains four integers n, p, w and d (1 ≤ n ≤ 10^{12}, 0 ≤ p ≤ 10^{17}, 1 ≤ d < w ≤ 10^{5}) — the number of games, the number of points the team got, the number of points awarded for winning a match, and the number of points awarded for a draw, respectively. Note that w > d, so the number of points awarded for winning is strictly greater than the number of points awarded for draw.

Output

If there is no answer, print -1.

Otherwise print three non-negative integers x, y and z — the number of wins, draws and losses of the team. If there are multiple possible triples (x, y, z), print any of them. The numbers should meet the following conditions: 

  * x ⋅ w + y ⋅ d = p, 
  * x + y + z = n. 

Examples

Input


30 60 3 1


Output


17 9 4


Input


10 51 5 4


Output


-1


Input


20 0 15 5


Output


0 0 20

Note

One of the possible answers in the first example — 17 wins, 9 draws and 4 losses. Then the team got 17 ⋅ 3 + 9 ⋅ 1 = 60 points in 17 + 9 + 4 = 30 games.

In the second example the maximum possible score is 10 ⋅ 5 = 50. Since p = 51, there is no answer.

In the third example the team got 0 points, so all 20 games were lost.
/*
javac C592.java && java C592
*/

import java.io.*;
import java.util.*;

public class C592 {
	public static void main(String[] args) { new C592(); }
	FS in = new FS();
	PrintWriter out = new PrintWriter(System.out);

	long n, p, w, d;	
	
	C592() {
		n = in.nextLong();
		p = in.nextLong();
		w = in.nextLong();
		d = in.nextLong();
		
		if (p == 0) out.printf("%d %d %d%n", 0, 0, n);
		else if (p < d) out.println(-1);
		else {
			long g = gcd(w, d);
			if (p %g != 0) out.println(-1);
			else {
				w /= g;
				d /= g;
				p /= g;

				long md = p % w;
				long[] ee = brexit(w, d);
				long wI = ((ee[1] % d) + d) % d;
				long mx = p / w;
				long cf = (((-wI * md) % d) + d) % d;

				long cw = mx - cf;
				if ((p - cw * w) % d != 0) throw null;
				long cd = (p - cw * w) / d;

				long l = lcm(w, d);
				long lw = l / w;
				long ld = l / d;

				if (cw < 0 && cd < 0) out.println(-1);
				else {
					long del = ld - lw;
					long t = cw + cd;
					long mt = ((t % del) + del) % del;
					if (mt > n) out.println(-1);
					else if (cw < 0) {
						long k = (-cw + (lw - 1)) / lw;
						cw = cw + k * lw;
						cd = cd - k * ld;
						t = cw + cd;
						if (cd < 0) out.println(-1);
						else if (t <= n) out.printf("%d %d %d%n", cw, cd, n - cw - cd);
						else {
							k = cd / ld;
							cw = cw + k * lw;
							cd = cd - k * ld;
							t = cd + cd;
							if (t > n) out.println(-1);
							else out.printf("%d %d %d%n", cw, cd, n - cw - cd);
						}
					}
					else if (cd < 0) {
						long k = (-cd + (ld - 1)) / ld;
						cw = cw - k * lw;
						cd = cd + k * cd;
						t = cw + cd;
						if (cw < 0) out.println(-1);
						else if (t <= n) out.printf("%d %d %d%n", cw, cd, n - cw - cd);
						else out.println(-1);
					}
					else {
						if (t <= n) out.printf("%d %d %d%n", cw, cd, n - cw - cd);	
						else {
							long k = cd / ld;
							cw = cw + k * lw;
							cd = cd - k * ld;
							t = cw + cd;
							if (t > n) out.println(-1);
							else out.printf("%d %d %d%n", cw, cd, n - cw - cd);
						}
					}
				}
			}
		}
		out.close();
	}

	long[] brexit(long x, long y) {
		if (y == 0) return new long[]{x, 1, 0};
		long[] res = brexit(y, x % y);
		long tmp = res[1] - res[2] * (x / y);
		res[1] = res[2]; res[2] = tmp;
		return res;
	}
	
	int abs(int x) { if (x < 0) return -x; return x; }
	long abs(long x) { if (x < 0) return -x; return x; }
	int max(int x, int y) { if (x < y) return y; return x; }
	int min(int x, int y) { if (x > y) return y; return x; }
	long max(long x, long y) { if (x < y) return y; return x; }
	long min(long x, long y) { if (x > y) return y; return x; }
	int gcd(int x, int y) { while (y != 0) { x = y^(x^(y = x)); y %= x; } return x; }
	long gcd(long x, long y) { while (y != 0) { x = y^(x^(y = x)); y %= x; } return x; }
	long lcm(int x, int y) { long xy = x; xy *= y; return xy / gcd(x, y); }
	long lcm(long x, long y) { return x * (y / gcd(x, y)); }

	class FS {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer("");
		String next() {
			while (!st.hasMoreTokens()) {
				try { st = new StringTokenizer(br.readLine()); }
				catch (Exception e) {}
			} return st.nextToken();
		}
		int nextInt() { return Integer.parseInt(next()); }
		long nextLong() { return Long.parseLong(next()); }
		double nextDouble() { return Double.parseDouble(next()); }
	}
}

