import bisect

#UnionFind
from collections import defaultdict

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]

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

unite=[0]*n
uf=UnionFind(n)
for i in range(n):
  L=bisect.bisect_left(x,x[i]+a)
  R=bisect.bisect_left(x,x[i]+b+1)
  if L!=R:
    uf.union(i,L)
    unite[L]+=1
    unite[R-1]-=1

for i in range(n-1):
  if i:
    unite[i]+=unite[i-1]
  if unite[i]:
    uf.union(i,i+1)

for i in range(n):
  print(uf.size(i))