import sys
from bisect import bisect_left,bisect_right
from itertools import accumulate
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))


class UnionFind:
    def __init__(self,n):
        self.par = [i for i in range(n+1)]  # 親のノード番号
        self.rank = [0]*(n+1)
        self.C = [1]*(n+1)

    def find(self,x):  # xの根のノード番号
        if self.par[x] == x:
            return x
        else:
            self.par[x] = self.find(self.par[x])
            return self.par[x]

    def same_check(self,x,y):  # x,yが同じグループか否か
        return self.find(x) == self.find(y)

    def unite(self,x,y):  # x,yの属するグループの併合
        x = self.find(x)
        y = self.find(y)
        if self.rank[x] < self.rank[y]:
            x,y = y,x
        if self.rank[x] == self.rank[y]:
            self.rank[x] += 1
        self.par[y] = x
        self.C[x] += self.C[y]


N,A,B = MI()
X = [-1]+LI()
Y = [0]*(N+2)

UF = UnionFind(N+1)
for i in range(1,N+1):
    x = X[i]
    ng,ok = i,N+1
    while ng+1 < ok:
        mid = (ng+ok)//2
        if X[mid] >= x+A:
            ok = mid
        else:
            ng = mid
    left = ok
    ok,ng = i,N+1
    while ok+1 < ng:
        mid = (ok+ng)//2
        if X[mid] <= x+B:
            ok = mid
        else:
            ng = mid
    right = ok
    if left <= right:
        if not UF.same_check(i,left):
            UF.unite(i,left)
        Y[left] += 1
        Y[right] -= 1

Y = list(accumulate(Y))
for i in range(1,N+1):
    if Y[i] > 0 and not UF.same_check(i,i+1):
        UF.unite(i,i+1)

for i in range(1,N+1):
    print(UF.C[UF.find(i)])