#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll n, t, x, y;
  cin >> n >> t >> x >> y;
  vector<ll> d(n);
  rep(i, n) cin >> d[i];
  sort(d.begin(), d.end());
  priority_queue<ll> que1, que2;
  {
    ll pre = -1, sz = 0;
    rep(i, n) {
      if (pre >= 0 && d[i] - pre > t) {
        que1.push(sz);
        sz = 1;
      } else {
        sz += 1;
      }
      pre = d[i];
    }
    que1.push(sz);
  }
  {
    ll pre = -1, sz = 0;
    rep(i, n) {
      if (pre >= 0 && d[i] != pre) {
        que2.push(sz);
        sz = 1;
      } else {
        sz += 1;
      }
      pre = d[i];
    }
    que2.push(sz);
  }
  vector<ll> ans(n);
  {
    ll now = 0, sz = 0;
    rep(k, n) {
      if (k >= now) {
        now += que1.top();
        que1.pop();
        sz += 1;
      }
      ans[k] = min(x * (sz - 1), y * k);
    }
  }
  {
    ll now = 0, sz = 0;
    rep(k, n) {
      if (k >= now) {
        now += que2.top();
        que2.pop();
        sz += 1;
      }
      ans[k] = min(ans[k], y * (sz - 1));
    }
  }
  rep(i, n) cout << (i ? " " : "") << ans[i];
  cout << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}