#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, t, x, y; cin >> n >> t >> x >> y;
	vector<int>d(n);
	rep(i, n)cin >> d[i];
	sort(all(d));
	vector<int>gs;
	rep(i, n) {
		if (i == 0 || d[i] - d[i - 1] > t)gs.push_back(0);
		gs.back()++;
	}
	sort(allR(gs));
	vector<int>imos(n + 1);
	int sum = 0;
	for (auto e : gs) {
		imos[sum + 1]++;
		sum += e;
	}
	rep(i, n)imos[i + 1] += imos[i];
	rep2(i, 1, n + 1) {
		long long val = 1LL * min(x, y) * (imos[i] - 1);
		cout << val << " ";
	}
	cout << endl;
	return 0;
}