from bisect import bisect_right as br
def par(a):
    L = []
    while P[a] >= 0:
        L.append(a)
        a = P[a]
    for l in L:
        P[l] = a
    return a
def unite(a, b):
    if par(a) != par(b):
        if P[par(b)] >= P[par(a)]:
            if P[par(b)] == P[par(a)]: P[par(a)] -= 1
            P[par(b)] = par(a)
        else:
            P[par(a)] = par(b)

N, A, B = map(int, input().split())
P = [-1 for i in range(N)]
X = [int(a) for a in input().split()]
done = [0] * N
i = 0
for i in range(N):
    if done[i]: continue
    done[i] = 1
    j = br(X, X[i] + B) - 1
    jma = jmi = j
    while done[j] == 0 and X[j] >= X[i] + A:
        unite(i, j)
        done[j] = 1
        jmi = j
        j -= 1
    done[jma] = 0
    done[jmi] = 0

cnt = [0] * N
for i in range(N):
    cnt[par(i)] += 1
print(*[cnt[par(i)] for i in range(N)], sep = "\n")