N,A,B = map(int,input().split())
X = list(map(int,input().split()))

class UnionFind:
    def __init__(self,N):
        self.parent = [i for i in range(N)]
        self._size = [1] * N
        self.count = 0
    def root(self,a):
        if self.parent[a] == a:
            return a
        else:
            self.parent[a] = self.root(self.parent[a])
            return self.parent[a]
    def is_same(self,a,b):
        return self.root(a) == self.root(b)
    def unite(self,a,b):
        ra = self.root(a)
        rb = self.root(b)
        if ra == rb: return
        if self._size[ra] < self._size[rb]: ra,rb = rb,ra
        self._size[ra] += self._size[rb]
        self.parent[rb] = ra
        self.count += 1
    def size(self,a):
        return self._size[self.root(a)]

uf = UnionFind(N)
imos = [0] * N
from bisect import bisect,bisect_left
for i,x in enumerate(X):
    j = bisect_left(X, x+A)
    k = bisect(X, x+B) - 1
    if j > k: continue
    if j < N:
        uf.unite(i,j)
        imos[j] += 1
        imos[k] -= 1

for i in range(N-1):
    imos[i+1] += imos[i]
for i,a in enumerate(imos[:-1]):
    if a:
        uf.unite(i,i+1)

ans = [uf.size(i) for i in range(N)]
print(*ans, sep='\n')