import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict, Counter
import bisect

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


class UnionFind:
    def __init__(self, N):
        self.N = N
        self.par = [-1] * N
        self.l = [i for i in range(N)]
        self.r = [i for i in range(N)]

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

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

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

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

        if x == y:
            return False
        if x > y:
            x, y = y, x

        self.par[x] += self.par[y]
        self.l[x] = min(self.l[x], self.l[y])
        self.r[x] = max(self.r[x], self.r[y])
        self.par[y] = x
        return True

    def unite_range(self, x, y):
        if x > y:
            return
        while self.right(x) < y:
            self.unite(self.right(x), self.right(x) + 1)

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

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

    def roots(self):
        return [i for i in range(self.N) if self.par[i] < 0]

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


def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1


def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1


def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)


def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)


N, A, B = map(int, input().split())
X = list(map(int, input().split()))
uf = UnionFind(N)
cnt = N
for i, x in enumerate(X):
    a = index_ge(X, x + A)
    b = index_le(X, x + B)
    if a > b:
        continue
    uf.unite_range(a, b)
    uf.unite(i, a)
for i in range(N):
    print(uf.size(i))