class UnionFindNode:
    def __init__(self, group_id, parent=None, value=None):
        self.group_id_ = group_id
        self.parent_ = parent
        self.value = value
        self.rank_ = 1
        self.member_num_ = 1

    def is_root(self):
        return not self.parent_

    def root(self):
        parent = self
        while not parent.is_root():
            parent = parent.parent_
            self.parent_ = parent
        return parent

    def find(self):
        root = self.root()
        return root.group_id_

    def rank(self):
        root = self.root()
        return root.rank_

    def unite(self, unite_node):
        root = self.root()
        unite_root = unite_node.root()

        if root.group_id_ != unite_root.group_id_:
            if root.rank() > unite_root.rank():
                n_root, child = root, unite_root
            else:
                n_root, child = unite_root, root
            child.parent_ = n_root
            n_root.rank_ = max(n_root.rank_, child.rank_ + 1)
            n_root.member_num_ = n_root.member_num_ + child.member_num_


N, A, B = map(int, input().split())
X = list(map(int, input().split()))
X.append(10**19)
nodes = [UnionFindNode(i) for i in range(N)]
j=k=-1
for i in range(N):
    while X[j+1] < X[i]+A:
        j+=1
    ks = []
    while X[k+1] <= X[i]+B:
        k+=1
        if j < k:
            ks.append(k)
    if j < k:
        nodes[i].unite(nodes[j+1])
    for kk in ks:
        nodes[i].unite(nodes[kk])
for i in range(N):
    print(nodes[i].root().member_num_)