from collections import defaultdict
from bisect import bisect_left
N, A, B = map(int, input().split())
X = list(map(int, input().split()))


class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1]*n
        self.rank = [0]*n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            return self.find(self.parents[x])

    def size(self, x):
        return -self.parents[self.find(x)]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        if self.rank[x] < self.rank[y]:
            x, y = y, x
        self.parents[x] += self.parents[y]
        self.parents[y] = x
        if self.rank[x] == self.rank[y]:
            self.rank[x] += 1

    def root(self):
        return [i for i in range(self.n) if self.parents[i] < 0]

    def allgroup_members(self):
        members = defaultdict(set)
        for m in range(self.n):
            members[self.find(m)].add(m)
        return members


Y = [0]*N
uf = UnionFind(N)


def calc(l, r):
    resl = bisect_left(X, l)
    resr = bisect_left(X, r+1)
    return resl, resr


for i in range(N):
    x = X[i]
    l = calc(x-B, x-A)
    if l[1] > l[0]:
        uf.union(i, l[0])
        Y[l[0]] += 1
        Y[l[1]-1] -= 1
    r = calc(x+A, x+B)
    if r[0] < r[1]:
        uf.union(i, r[0])
        Y[r[0]] += 1
        Y[r[1]-1] -= 1

for i in range(N-1):
    Y[i+1] += Y[i]
for i in range(N-1):
    if Y[i]:
        uf.union(i, i+1)

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