#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000000
#define Inf64 1000000000000000001LL

int main(){
	
	long long N,T,X,Y;
	cin>>N>>T>>X>>Y;
	vector<long long> d(N);
	rep(i,N)cin>>d[i];
	sort(d.begin(),d.end());
	vector<long long> t;
	rep(i,N){
		if(i==0 || abs(d[i]-d[i-1])>T)t.push_back(1);
		else t.back()++;
	}
	sort(t.rbegin(),t.rend());
	vector<long long> ans(N+1);
	long long sum = 0;
	int ci = 1;
	rep(i,t.size()){
		rep(j,t[i]){
			ans[ci] = sum;
			ci++;
		}
		sum += min(X,Y);
	}
	for(int i=1;i<=N;i++){
		if(i!=1)cout<<' ';
		cout<<ans[i];
	}
	cout<<endl;
	return 0;
}