#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
int main()
{
  ll N, T, X, Y;
  cin >> N >> T >> X >> Y;
  vector<ll> D(N);
  for (int i = 0; i < N; i++)
  {
    cin >> D[i];
  }
  ranges::sort(D);
  int cnt = 1;
  vector<int> v;
  for (int i = 0; i < N; i++)
  {
    if (D[i+1] - D[i] <= T)
    {
      cnt++;
    }
    else
    {
      v.push_back(cnt);
      cnt = 1;
    }
  }
  v.push_back(cnt);
  ranges::sort(v, greater<int>());
  vector<int> sum(size(v));
  sum[0] = v[0];
  for (size_t i = 1; i < size(v); i++)
  {
    sum[i] = sum[i-1] + v[i];
  }
  for (int i = 0; i < N; i++)
  {
    cout << (ranges::lower_bound(sum, i+1) - sum.begin()) * min(X, Y) << " \n"[i == N-1];
  }
  return 0;
}
/*
  File : ~/yukicoder/526/B.cpp
  Date : 2025/03/07
  Time : 21:28:34
*/