import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Collections;
import java.util.PriorityQueue;

public class Main {
	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String[] sa = br.readLine().split(" ");
		int n = Integer.parseInt(sa[0]);
		int t = Integer.parseInt(sa[1]);
		int x = Integer.parseInt(sa[2]);
		int y = Integer.parseInt(sa[3]);
		sa = br.readLine().split(" ");
		int[] d = new int[n];
		for (int i = 0; i < n; i++) {
			d[i] = Integer.parseInt(sa[i]);
		}
		br.close();

		Arrays.sort(d);
		PriorityQueue<Integer> que = new PriorityQueue<>(Collections.reverseOrder());
		int cnt = 0;
		for (int i = 1; i < n; i++) {
			if (d[i] - d[i - 1] <= t) {
				cnt++;
			} else {
				que.add(cnt);
				cnt = 0;
			}
		}
		que.add(cnt);

		int m = Math.min(x, y);
		long ans = 0;
		StringBuilder sb = new StringBuilder();
		sb.append(0);
		int rem = 0;
		if (!que.isEmpty()) {
			rem = que.poll();
		}
		for (int i = 1; i < n; i++) {
			if (rem > 0) {
				rem--;
			} else if (rem == 0) {
				rem--;
				ans += m;
			} else if (!que.isEmpty()) {
				rem = que.poll();
				if (rem <= 0) {
					ans += m;
				}
				rem--;
			} else {
				ans += m;
			}
			sb.append(' ').append(ans);
		}
		System.out.println(sb.toString());
	}
}