/**
	author:  shobonvip
	created: 2025.03.07 21:09:01
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	ll n, t, x, y;
	cin >> n >> t >> x >> y;
	vector<ll> d(n);
	rep(i,0,n) {
		cin >> d[i];
	}
	sort(all(d));

	ll memo = -1e18;
	ll tmp = 0;
	vector<ll> a;
	rep(i,0,n){
		if (memo + t < d[i]) {			
			if (tmp > 0) {
				a.push_back(tmp);
			}
			tmp = 1;
		}else{
			tmp += 1;
		}
		memo = d[i];
	}

	a.push_back(tmp);
	sort(all(a));
	reverse(all(a));

	vector<ll> rui(n + 5);
	ll tar = 0;
	for (ll x: a) {
		tar += x;
		rui[tar + 1] += 1;
	}

	rep(i,0,n + 4) {
		rui[i+1] += rui[i];
	}

	rep(i,1,n+1){
		cout << rui[i] * min(x, y) << ' ' ;
	}
	cout << endl;
}