#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];
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);
    std::vector<int> A(N - 1);
    for (int i = 0 ; i + 1 < N ; i++) A[i] = (D[i + 1] - D[i] > T ? X : 0);
    std::cout << 0LL;
    if (N >= 2) {
        bool fn = std::find(A.begin(), A.end(), 0) != A.end();
        std::cout << ' ' << (fn ? 0LL : std::min(X, Y));
    }
    if (N >= 3) {
        std::vector<long long> ans(N + 1, (int)9e18);
        for (int i = 3 ; i <= N ; i++) ans[i] = std::min(ans[i], (long long)i * Y);
        for (int i = 0 ; i < N - 1 ; i++) {
            long long s = A[i];
            for (int j = i + 1 ; j <= N - 1 ; j++) {
                if (j - i >= 2) ans[j - i + 1] = std::min(ans[j - i + 1], s); 
                if (j < N - 1) s += A[j];
            }
        }
        for (int i = 3 ; i <= N ; i++) std::cout << ' ' << ans[i];
    }
    std::cout << '\n';
}