// https://yukicoder.me/submissions/1036769 と大差ないTLE解
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const long long inf = 1000000000000000000;
int main() {
  int N, T, X, Y;
  cin >> N >> T >> X >> Y;
  vector<int> D(N);
  for(int i = 0; i < N; i++) {
    cin >> D[i];
  }
  sort(D.begin(), D.end());
  vector<long long> ans(N + 1, inf);
  do {
    long long cur = 0;
    for(int k = 1; k <= N; k++) {
      ans[k] = min(ans[k], cur);
      if(k < N) {
        if(D[k] - D[k - 1] > T) {
          cur += X;
        }
        if(D[k] - D[k - 1] < 0) {
          cur += Y;
        }
      }
    }
  } while(next_permutation(D.begin(), D.end()));
  for(int k = 1; k <= N; k++) {
    cout << ans[k] << " \n"[k == N];
  }
  return 0;
}