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

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

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

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

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

import bisect

n,a,b = map(int,input().split())
x = list(map(int,input().split()))

uf = UnionFind(n+1)

for i in range(n):
    
    A = bisect.bisect_left(x,x[i]+a)
    B = bisect.bisect_left(x,x[i]+b)
    
    
    for j in range(A,B+1):
        if i == j:
            pass
        
        if A < n and j < n:
            if j != A and a <= abs(x[j]-x[A]) <= b:
                break
        
        
        if j >= n:
            break

        if a <= abs(x[i]-x[j]) <= b:
            uf.union(i,j)
            
for i in range(n):
    print(uf.size(i))