#include<bits/stdc++.h>

using namespace std;

#define ll long long

ll x,y,z,a,b,c,d,n;

ll exgcd(ll a,ll b,ll &x,ll &y){//返回（a,b）

    if(b==){x=,y=;return a;}

    ll d=exgcd(b,a%b,x,y);

    ll z=x;x=y,y=z-a/b*y;

    return d;

}

int main(){

    cin>>n>>c>>a>>b;//1e12,c:1e17,a:1e5,b:1e5

    d=__gcd(a,b);

    if(c%d!=){

        puts("-1");return ;

    }

    exgcd(a,b,x,y);

//923399641127 50915825165227299 94713 49302

    x*=c/d;y*=c/d;

    ll mod1=b/d,mod2=a/d;

    //先让x，y都变成非负整数

    if(x<){

        ll k;

        if(x%mod1==)k=abs(x/mod1);

        else k=abs(x/mod1)+;

        x+=k*mod1;

        y-=k*mod2;

    }

    else if(y<){

        ll k;

        if(y%mod2==)k=abs(y/mod2);

        else k=abs(y/mod2)+;

        x-=k*mod1;

        y+=k*mod2;

    }

    if(x< || y<){

        puts("-1");return ;

    }

    if(x>n && y>n){

        puts("-1");return ;

    }

    //让x+y的值取到最小值

    if(mod1>mod2){

        ll k=x/mod1;

        x-=k*mod1;

        y+=k*mod2;

    }

    else {

        ll k=y/mod2;

        x+=k*mod1;

        y-=k*mod2;

    }

    if(x+y>n){puts("-1");return ;}

    cout<<x<<" "<<y<<" "<<n-x-y<<"\n";

}