"""

https://yukicoder.me/problems/no/1170

いもす法で辺を引きつつ、区間の左端にだけ辺を繋げて、ufしていけばいい
in するのは x+A以上の最小の点で、抜けるのはx+B以下の最大の点
→ 

"""

def uf_find(n,p):

    ufl = []

    while p[n] != n:
        ufl.append(n)
        n = p[n]

    for i in ufl:
        p[i] = n

    return n


def uf_union(a,b,p,rank,numlis):

    ap = uf_find(a,p)
    bp = uf_find(b,p)

    if ap == bp:
        return True
    else:

        if rank[ap] > rank[bp]:
            p[bp] = ap
            numlis[ap] += numlis[bp]
        elif rank[ap] < rank[bp]:
            p[ap] = bp
            numlis[bp] += numlis[ap]
        else:
            p[bp] = ap
            rank[ap] += 1
            numlis[ap] += numlis[bp]

        return False

from sys import stdin
import bisect

N,A,B = map(int,stdin.readline().split())
x = list(map(int,stdin.readline().split()))
x.append(float("inf"))

p = [i for i in range(N)]
rank = [0] * N
numlis = [1] * N
imos = [0] * N

for i in range(N):

    l = bisect.bisect_left(x , x[i]+A)
    r = bisect.bisect_right(x , x[i]+B) - 1

    if 0 <= l < N and x[i]+A <= x[l] <= x[i]+B:
        uf_union(i,l,p,rank,numlis)
        imos[l] += 1
    if 0 <= r < N and x[i]+A <= x[r] <= x[i]+B:
        uf_union(i,r,p,rank,numlis)
        imos[r] -= 1

now = 0
for i in range(N-1):
    now += imos[i]
    if now > 0:
        uf_union(i,i+1,p,rank,numlis)

for i in range(N):
    print (numlis[uf_find(i,p)])