class UnionFind:
    def __init__(self,n):
        self.n = n
        self.parent_size = [-1]*n
 
    def leader(self,a):
        if self.parent_size[a] < 0:
            return a
        self.parent_size[a] = self.leader(self.parent_size[a])
        return self.parent_size[a]
 
    def merge(self,a,b):
        x, y = self.leader(a), self.leader(b)
        if x == y:
            return 
        if abs(self.parent_size[x]) < abs(self.parent_size[y]):
            x, y = y, x
        self.parent_size[x] += self.parent_size[y]
        self.parent_size[y] = x
        return 
 
    def same(self,a,b):
        return self.leader(a) == self.leader(b)
 
    def size(self,a):
        return abs(self.parent_size[self.leader(a)])
 
    def groups(self):
        result = [[] for _ in range(self.n)]
        for i in range(self.n):
            result[self.leader(i)].append(i)
        return [r for r in result if r != []]

N, T, X, Y = map(int, input().split())
D = sorted(list(map(int, input().split())))

UF = UnionFind(N)
for i in range(N-1):
    if D[i+1]-D[i] <= T:
        UF.merge(i, i+1)
L = []
for i in range(N):
    if UF.leader(i) == i:
        L.append(UF.size(i))
L.sort(reverse=True)
for i in range(1, len(L)):
    L[i] += L[i-1]

idx = 0
ans = []
for i in range(N):
    if idx < len(L) and L[idx] == i:
        idx += 1
    ans.append(min(X, Y)*idx)

print(*ans)