from bisect import bisect_left, bisect_right


class UnionFind:
    def __init__(self, n: int):
        self.data = [-1] * (n+1)
        self.nexts = [i for i in range(n+1)]

    def root(self, a: int) -> int:
        if self.data[a] < 0: return a
        self.data[a] = self.root(self.data[a])
        return self.data[a]

    def unite(self, a: int, b: int) -> bool:
        pa = self.root(a)
        pb = self.root(b)
        if pa == pb: return False
        if self.data[pa] > self.data[pb]:
            pa, pb = pb, pa
        self.data[pa] += self.data[pb] # pa を pb をつなげる
        self.data[pb] = pa
        self.nexts[pa], self.nexts[pb] = self.nexts[pb], self.nexts[pa]
        return True

    def is_same(self, a: int, b: int) -> bool:
        return self.root(a) == self.root(b)

    def size(self, a: int) -> int:
        """a が属する集合のサイズ"""
        return -self.data[self.root(a)]

    def group(self, a: int):
        """a が属する集合"""
        yield a
        x = a
        while self.nexts[x] != a:
            x = self.nexts[x]
            yield x


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

uf = UnionFind(N)
imos = [0] * (N+1)
for i, x in enumerate(X):
    l = bisect_left(X, x+A)
    r = bisect_right(X, x+B)
    if l < r:
        uf.unite(i, l)
        uf.unite(i, r-1)
        imos[l] += 1
        imos[r-1] -= 1

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

for i in range(N):
    print(uf.size(i))