// correct

#include <algorithm>
#include <iostream>
#include <vector>

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int n, t, x, y;
    std::cin >> n >> t >> x >> y;

    std::vector<int> d(n);
    for (auto &e : d) std::cin >> e;
    std::sort(d.begin(), d.end());

    std::vector<int> group_sizes;
    for (int i = 0; i < n; ++i) {
        if (i == 0 or d[i] - d[i - 1] > t) {
            group_sizes.push_back(0);
        }
        ++group_sizes.back();
    }
    std::sort(group_sizes.begin(), group_sizes.end(), std::greater{});

    std::vector<int> group_num_imos(n + 1);
    // |x....|x...|x..| x: グループ数が増加する点
    for (int size_sum = 0; int size : group_sizes) {
        // k > size_sum に +1
        ++group_num_imos[size_sum + 1];
        size_sum += size;
    }
    for (int k = 1; k <= n; ++k) {
        group_num_imos[k] += group_num_imos[k - 1];
    }
    for (int k = 1; k <= n; ++k) {
        if (k != 1) std::cout << ' ';
        std::cout << 1LL * std::min(x, y) * (group_num_imos[k] - 1);
    }
    std::cout << std::endl;
}