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.
"""_________________________10_________________________
____________________________0¶10_______________________
_____________________________1111_____________0________
_____________________________110110_________0¶0________
______________0111000________0100111______011¶_________
________________01¶11111100__0111111¶0__011011_________
__________________01111111¶¶111111111¶1¶¶10011_________
____________________11111111¶¶¶¶¶¶¶111111000¶0______000
_________________0001111111¶¶¶¶11111111111001101111¶¶¶_
___________00011¶¶¶¶111¶¶¶¶¶¶1111111111111111¶¶1111¶1__
_______00111111111111¶¶¶¶¶¶¶¶111111111111111011111¶1___
______00100000111111¶¶¶¶¶¶¶1111111111111111111¶11¶0____
_____________011111¶¶¶¶¶¶¶111111111111111111101¶1______
___________0111111¶¶¶¶¶¶111111111111¶¶111111111¶1______
________011101111¶¶¶¶¶1111111111111¶1¶1111111111¶0_____
_____01110001111¶¶¶¶¶1111111111111¶1__¶¶111111¶11¶0____
____00_____11111¶¶¶¶1111111111111¶¶0__0¶111111¶111¶____
_________1¶111¶¶¶¶¶11111111111111¶00___0¶111101111¶0___
_______011111¶¶¶¶¶¶1¶¶1111111111¶100____¶1111111111¶___
______1¶11111¶¶¶¶¶¶¶¶11111111111¶_______¶11110111_0¶1__
____01¶11111¶¶¶¶¶¶¶¶¶1111111111¶¶¶¶¶¶111¶111¶10110_0¶0_
___0¶1001111¶¶¶¶¶¶¶¶¶111111111¶0____00000¶11¶¶1111___1_
__110__01111¶¶¶¶¶¶¶¶111111111¶0____010¶¶01111¶111¶_____
______111111¶¶¶¶¶¶¶111111111¶0____0000100¶1111¶11¶0____
____0¶10111¶¶¶¶¶¶¶¶11111111¶1___________0¶1111¶11¶1____
___11__01111¶¶¶¶¶¶11111111¶¶0___________0¶1111¶111¶____
__0___01111¶¶¶¶¶¶¶11111111¶0____________0¶1111¶¶11¶____
______111111¶¶¶¶¶11111111¶¶___000_______0¶11¶1¶111¶0___
_____111111¶¶¶¶¶¶11111111¶0____00_______1¶11¶¶¶101¶1___
____11100111¶¶¶¶¶1111111¶1__0000000____0¶111¶¶¶100¶¶___
___110_0111¶¶¶¶¶11111111¶0___00000____0¶¶11¶¶¶¶¶100¶___
0_00___¶¶¶¶¶¶¶¶¶¶¶111111¶0___________¶¶¶¶11¶¶¶¶¶100____
00000001111¶¶¶¶¶¶¶11111100__________¶¶¶¶11¶¶1¶¶¶101____
0000100000000_¶¶¶¶111111000_______00¶¶¶¶1¶¶¶11¶¶101____
0001111111111_1¶¶¶11111¶¶¶¶¶11111¶¶¶¶¶¶¶1¶¶¶11¶¶000____
001111111111101¶¶¶¶1111¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶11¶00100__
111111111111100¶¶¶¶1111¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶¶1010110_
111111111111100¶¶¶¶1111¶¶1¶¶¶¶¶¶¶¶¶¶¶1¶¶¶¶¶¶¶¶¶¶1100010
111111111111110¶¶¶¶111¶¶¶¶11¶¶¶¶¶¶¶¶111¶¶¶¶¶¶¶¶¶0011000
1111111111111101¶¶¶111¶11¶¶¶¶1111111111¶¶¶¶¶¶¶¶¶0_¶¶100
1111111111111110¶¶¶111¶¶111111111¶1¶¶¶¶¶¶¶¶¶1010_0¶¶¶10
11111111111111100¶¶111¶¶¶¶¶¶¶1¶¶¶¶¶¶¶100¶¶¶¶111_0¶¶¶¶11
11111111111111100¶¶111¶¶¶¶¶¶¶¶1100000000¶¶¶¶11110¶¶¶¶¶1
111111111111100001¶1111000000000111111111¶¶¶111111¶¶¶¶1
11111111111100¶¶00¶11¶1011111111111111111¶¶¶1011000¶¶¶1
11111111110_0¶¶¶¶1¶1111111111111111111111¶¶¶1_011101¶¶¶
1111111110_¶¶¶1111¶¶1¶1111111111111111100¶¶¶10011100¶¶¶
1111111100¶¶¶111¶1¶11111111111111000000111¶¶11111110¶¶¶
1111110_0¶¶1111¶11¶¶1¶111_0100000111111111¶¶111111101¶¶
00111001¶¶11¶11111¶111000_0111111111111111¶¶111111101¶¶
110001¶¶¶111¶11¶111¶11111111111111111111111¶111111111¶¶
111¶¶¶¶11111¶¶111111111111111111111111111111111111111¶¶
00¶¶¶¶1111111¶11111111111111111111111111111111111111"""
n,p,w,d = map(int,input().split())
if p==0:
    print(0," ",0," ",n)
elif p<d or n*w<p or w>p and p//d>n or p%w!=0 and p%d!=0 and w%d==0:
    print(-1)
else:
    if p%w==0:
        x=p//w;
        y=0;
        z=n-x;
        print(x," ",y," ",z)
    else:
        x=p//w;
        y=(p-x*w)//d;
        z=n-x-y;
        if (p-x*w)%d==0:
            z=n-x-y
            print(x," ",y," ",z)
 
        else:
            while True:
                x-=1;
                y=(p-x*w)//d;
                z=n-x-y;
                if x*w+y*d==p:
                    print(x," ",y," ",z)
                    break