#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
    cin.tie(0)->sync_with_stdio(0);
    cout.tie(0);
    ll N,T,X,Y;
    cin>>N>>T>>X>>Y;
    vector<ll>D(N);
    rep(i,N) cin>>D.at(i);
    sort(D.begin(),D.end());
    vector<ll>sa(N-1);
    for(int i=0;i<N-1;i++){
        sa.at(i)=D.at(i+1)-D.at(i);
    }
    vector<ll>data;
    ll a=1;
    for(int i=0;i<N-1;i++){
        if(sa.at(i)<=T) a++;
        else{
            data.push_back(a);
            a=1;
        }
    }
    data.push_back(a);
    sort(data.rbegin(),data.rend());
    ll ans=0;
    ll cnt=data.at(0);
    ll minimum=min(X,Y);
    for(int i=1;i<=N;i++){
        if(i>cnt){
            ans++;
            cnt+=data.at(ans);
        }
        cout<<ans*minimum<<" ";
    }
    cout<<endl;
}