from bisect import bisect_right as br
from collections import deque

class range_edge:
    def __init__(self, n):
        self.k = (n-1).bit_length()
        self.K = 1 << self.k
        self.KK = self.K * 3
        self.E = [[] for _ in range(self.KK)]
        for i in range(2, self.K * 2):
            self.E[i >> 1].append(i)
        for i in range(self.K, self.KK - 2):
            self.E[i].append(i + self.KK >> 1)
        self.c = self.KK # Number of Vertices
    
    def indices(self, l, r):
        l += self.K
        r += self.K
        while l < r:
            if l & 1:
                yield l
                l += 1
            l >>= 1
            if r & 1:
                r -= 1
                yield r
            r >>= 1
    
    def add_range_edge(self, a, b, c, d): # from [a, b) to [c, d)
        if a >= b or c >= d: return
        for i in self.indices(a - self.KK, b - self.KK):
            self.E[i + self.KK].append(self.c)
        self.c += 1
        self.E.append([self.c]) # cost = 0
        self.E.append([])
        for i in self.indices(c, d):
            self.E[self.c].append(i)
        self.c += 1
    
    def BFS0(self, i0=0):
        i0 += self.K
        Q = deque([i0])
        n = self.c
        D = [-1] * n
        D[i0] = 0
        while Q:
            i = Q.popleft()
            for j in self.E[i]:
                if D[j] == -1:
                    D[j] = 0
                    Q.append(j)
        return [i - self.K for i in range(self.K, self.K * 2) if D[i] >= 0]

N, A, B = map(int, input().split())
re = range_edge(N)
X = [int(a) for a in input().split()]
for i in range(N):
    l = br(X, X[i] + A - 1)
    r = br(X, X[i] + B)
    re.add_range_edge(i, i + 1, l, r)
    re.add_range_edge(l, r, i, i + 1)

ANS = [0] * N
for i in range(N):
    if ANS[i]: continue
    bfs = re.BFS0(i)
    ans = len(bfs)
    for j in bfs:
        ANS[j] = ans
print(*ANS, sep = "\n")