#include <iostream>
#include <iomanip>
#include <cassert>
#include <vector>
#include <algorithm>
#include <utility>
#include <numeric>
// #include "Src/Utility/BinarySearch.hpp"
// #include "Src/Sequence/CompressedSequence.hpp"
// #include "Src/Sequence/RunLengthEncoding.hpp"
// using namespace zawa;
// #include "atcoder/modint"
// using mint = atcoder::modint998244353;
int N, T, X, Y, D[500050];
std::vector<long long> solve() {
    std::vector<long long> res(N, (long long)9e18);
    std::vector<int> A(N - 1);
    for (int i = 0 ; i + 1 < N ; i++) A[i] = (D[i + 1] - D[i] > T ? std::min(X, Y) : 0);
    res[0] = 0;
    for (int i = 0 ; i < N - 1 ; i++) {
        long long s = 0LL;
        for (int j = i ; j <= N - 1 ; j++) {
            res[j - i] = std::min(res[j - i], s); 
            if (j < N - 1) s += A[j];
        }
    }
    return res;
}
int main() {
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    std::ios::sync_with_stdio(false);
    std::cin >> N >> T >> X >> Y;
    for (int i = 0 ; i < N ; i++) std::cin >> D[i];
    std::sort(D, D + N);
    auto ans = solve();
    for (int i = 0 ; i < N ; i++) std::cout << ans[i] << (i + 1 == N ? '\n' : ' ');
}