What is the Codeforces Round related to the football season?

本文共计1097个文字，预计阅读时间需要5分钟。

足球赛季在贝尔兰刚刚结束。根据贝尔兰足球的规则，每场比赛都是由两队进行的。每场比赛的结果要么是平局，要么是其中一支球队的胜利。如果一支球队赢得了比赛……

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 getsw">wwpoints, and the opposing team gets0">00points. If the game results in a draw, both teams getd">ddpoints.

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 playedn">nngames and gotp">pppoints for them.

You have to determine three integersx">xx,y">yyandz">zz— 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)">(x,y,z)(x,y,z), report about it.

Input

The first line contains four integersn">nn,p">pp,w">wwandd">dd(1&#x2264;n&#x2264;1012,0&#x2264;p&#x2264;1017,1&#x2264;d&lt;w&#x2264;105)">(1≤n≤1012,0≤p≤1017,1≤d<w≤105)(1≤n≤1012,0≤p≤1017,1≤d<w≤105)— 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 thatw&gt;d">w>dw>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&#x2212;1">−1−1.

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

• x&#x22C5;w+y&#x22C5;d=p">x⋅w+y⋅d=px⋅w+y⋅d=p,
• x+y+z=n">x+y+z=nx+y+z=n.

Examples input Copy

30 60 3 1 output Copy

17 9 4 input Copy

10 51 5 4 output Copy

-1 input Copy

20 0 15 5 output Copy

0 0 20 Note

One of the possible answers in the first example —17">1717wins,9">99draws and4">44losses. Then the team got17&#x22C5;3+9&#x22C5;1=60">17⋅3+9⋅1=6017⋅3+9⋅1=60points in17+9+4=30">17+9+4=3017+9+4=30games.

In the second example the maximum possible score is10&#x22C5;5=50">10⋅5=5010⋅5=50. Sincep=51">p=51p=51, there is no answer.

In the third example the team got0">00points, so all20">2020games were lost.

#include <bits/stdc++.h> using namespace std; #define ll long long #define TLE ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll m,n,l,r; int main() { TLE; while(cin>>n>>m>>l>>r) { for(int i=0;i<min(n,l);i++) { if(m-i*r<0) break; if( !((m-i*r)%l) ) { if(i+((m-i*r)/l) <=n ) { cout<<(m-i*r)/l<<" "<<i<<" "<<n-i-(m-i*r)/l<<endl; return 0; } } } cout<<-1<<endl; } return 0; }