// (◕ᴗ◕✿) // #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> #define rep(i, n) for (ll i = 0; i < (n); i++) #define srep(i, s, n) for (ll i = s; i < (n); i++) #define len(x) ((int)(x).size()) #define all(x) (x).begin(), (x).end() using namespace std; template<typename T> using vc = vector<T>; template<typename T> using vv = vc<vc<T>>; template<typename T> using vvv = vv<vc<T>>; using vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>; using ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>; using ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>; using uint = unsigned int; using ull = unsigned long long; const ld pi = acos(-1.0); const int inf = 0x3f3f3f3f; const ll INF = 0x3f3f3f3f3f3f3f3f; // const ll mod = 1000000007; const ll mod = 998244353; inline bool inside(ll y, ll x, ll H, ll W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); } #define debug(var) do{std::cout << #var << " : \n";view(var);}while(0) template<typename T> void view(T e){cout << e << endl;} template<typename T> void view(const vc<T>& v){for(const auto& e : v){ cout << e << " "; } cout << endl;} template<typename T> void view(const vv<T>& vv){ for(const auto& v : vv){ view(v); } } int main(){ int N; ll T, X, Y; cin >> N >> T >> X >> Y; vl D(N); rep(i, N) cin >> D[i]; sort(all(D)); vl ans(N + 1, INF); vi stack(1, 0); rep(i, N){ if (i < N - 1 && D[i + 1] - D[i] > T){ stack.back()++; stack.push_back(0); }else stack.back()++; } sort(all(stack), greater<int>()); int nw = 0; for (int i = 0; i < len(stack); i++){ srep(j, nw, nw + stack[i]) ans[j] = i * X; nw += stack[i]; } stack.clear(); stack.push_back(0); rep(i, N){ if (i < N - 1 && D[i + 1] != D[i]){ stack.back()++; stack.push_back(0); }else stack.back()++; } sort(all(stack), greater<int>()); nw = 0; for (int i = 0; i < len(stack); i++){ srep(j, nw, nw + stack[i]) ans[j] = min(ans[j], i * Y); nw += stack[i]; } srep(i, 0, N) cout << ans[i] << " "; cout << endl; }