import heapq

n,t,x,y=map(int,input().split())
d=list(map(int,input().split()));d.sort()
hq=[]
q=0
while q<n:
    s=1
    while q+1<n and d[q+1]-d[q]<=t:
        q+=1;s+=1
    heapq.heappush(hq,-s)
    q+=1
ans=[0]*(n+1)
s=-heapq.heappop(hq)
while hq:
    ans[s]+=min(x,y) 
    s-=heapq.heappop(hq)
for i in range(n):
    ans[i+1]+=ans[i]
print(" ".join(map(str,ans[:n])))