#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;

int main()
{
    int n, t;
    ll x, y;
    cin >> n >> t >> x >> y;
    int s[500005];
    for (int i = 0; i < n; i++)
    {
        cin >> s[i];
    }
    sort(s, s + n);
    vector<int> v;
    int c = 0;
    for (int i = 0; i < n; i++)
    {
        c++;
        if (i == n - 1 || s[i + 1] - s[i] > t)
        {
            v.push_back(c);
            c = 0;
        }
    }
    sort(v.begin(), v.end(), greater<int>());
    int i = 0;
    int d = 0;
    for (int k = 1; k <= n; k++)
    {
        i++;
        cout << d * min(x, y) << " ";
        if (i == v[d])
        {
            d++;
            i = 0;
        }
    }
    cout << endl;
}