class UnionFind:
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n
        self._left = [i for i in range(n)]
        self._right = [i for i in range(n)]

    def find(self, x):
        """ 根を見つける関数を定義(同時にxを直接根にくっつける操作も行う)"""
        tmp = []
        parents = self.parents
        while parents[x] >= 0:
            tmp.append(x)
            x = parents[x]
        for y in tmp:
            parents[y] = x
        return 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
        self._left[x] = min(self._left[x],self._left[y])
        self._right[x] = max(self._right[x],self._right[y])

    def union_range(self, l, r):
        """ 閉区間[l,r]の要素をくっつける """
        if l>r: return
        while self._right[l]<r:
            self.union(self._right[l],self._right[l]+1)

    def left(self,x):
        x = self.find(x)
        return self._left[x]

    def right(self,x):
        x = self.find(x)
        return self._right[x]

    def same(self, x, y):
        """ xとyが同じ根の子かを判定 """
        return self.find(x) == self.find(y)

    def size(self, x):
        """ xの根のparent(= 要素数)を返す """
        return -self.parents[self.find(x)]

    def members(self, x):
        """ xが属するグループの要素をリストとして返す O(N)"""
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        """ 全ての根の要素をリストとして返す O(N)"""
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        """ グループの数を返す O(N)"""
        return len(self.roots())

    def size_list(self):
        """ 各グループの要素数のリストを返す(根の番号は返さない) O(N)"""
        return [-x for x in self.parents if x < 0]

    def all_group_members(self):
        """ {根:[根の子(根を含む)のリスト],...}を辞書で返す O(N)"""
        res = [[] for _ in range(self.n)]
        for i in range(self.n):
            x = self.find(i)
            res[x].append(i)
        return {r: res[r] for r in self.roots()}

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

#################################################################
def example():
    global input
    example = iter(
        """
10 2 5
1 8 9 12 13 15 16 24 27 29
        """
            .strip().split("\n"))
    input = lambda: next(example)
#################################################################

import sys
input = sys.stdin.readline
from bisect import *

example()

N, A, B = map(int, input().split())
U = UnionFind(N)
X=list(map(int, input().split()))
for i in range(N):
    x=X[i]
    l,r=bisect_left(X,x+A),bisect_right(X,x+B)
    if l>=N: continue
    U.union_range(l,r-1)
    if r-l>0:
        U.union(i,l)
for i in range(N):
    print(U.size(i))