#include<bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define pb push_back
#define all(a) begin(a),end(a)
#define allr(a) rbegin(a),rend(a)
#define ff first
#define ss second
template<class T> bool chmax(T& a,T b){return a<b?a=b,1:0;}
template<class T> bool chmin(T& a,T b){return a>b?a=b,1:0;}
using ll =long long;
using pii =pair<int,int>;
using pll=pair<long long,long long>;
using vi=vector<int>;
using vll=vector<ll>;
inline bool ingrid(int a,int b,int h,int w){
    return 0<=a&&a<h&&0<=b&&b<w;
}

const int INFI = numeric_limits<int>::max() / 2; const long long INFL = numeric_limits<long long>::max() / 2;
constexpr pii dx4[4] = {pii{-1, 0}, pii{0, -1},pii{1, 0}, pii{0, 1} };
#define endl '\n'
struct UnionFind{
    vector<int> par;
    int n;
    UnionFind()=default;
    UnionFind(int n):n(n),par(n,-1){}
    int find(int k){return par[k]<0 ? k : par[k]=find(par[k]);}
    int size(int k){return -par[find(k)];}
    bool unite(int x,int y){
        x=find(x),y=find(y);
        if(x==y)return false;
        if(par[x]>par[y])swap(x,y);
        par[x]+=par[y];
        par[y]=x;
        return true;
    }
    bool same(int x,int y){return find(x)==find(y);}
};

ll n,t,x,y;
vll d;
void solve(){
    sort(all(d));
    vll ans(n+1,INFL);
    UnionFind uf(n);
    rep(i,0,n-1){
        if(d[i+1]-d[i]<=t)uf.unite(i,i+1);
    }
    priority_queue<ll> q;
    vi seen(n);
    rep(i,0,n){
        if(seen[uf.find(i)])continue;
        seen[uf.find(i)]=1;
        q.push(uf.size(i));
    }
    ll cur{};
    ll cnt{};
    while(!q.empty()){
        cnt++;
        cur+=q.top();q.pop();
        chmin(ans[cur],cnt);
    }
    rrep(i,n,1){
        chmin(ans[i-1],ans[i]);
    }
    rep(i,1,n+1){
        cout<<(ans[i]-1)*min(x,y)<<' ';
    }
    cout<<endl;
}

int main(){
    cin>>n>>t>>x>>y;
    d.resize(n);
    rep(i,0,n)cin>>d[i];
    solve();
    return 0;
}
/*

*/