class UnionFind:
  def __init__(self, n):
    self.node = [-1 for _ in range(n)]

  def root(self, v):
    if self.node[v] < 0:
      return v

    st = []
    while self.node[v] >= 0:
      st.append(v)
      v = self.node[v]

    for u in st:
      self.node[u] = v

    return v

  def size(self, v):
    v = self.root(v)
    return (- self.node[v])

  def same(self, u, v):
    return self.root(u) == self.root(v)

  def unite(self, u, v):
    ru = self.root(u)
    rv = self.root(v)
    if ru == rv:
      return

    du = self.node[ru]
    dv = self.node[rv]
    if du <= dv:
      self.node[rv] = ru
      self.node[ru] += dv
    else:
      self.node[ru] = rv
      self.node[rv] += du

import bisect as bs

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

cnt = [0 for _ in range(n + 1)]
uf = UnionFind(n)
for i in range(n):
  l = bs.bisect_left(x, x[i] + a)
  if l == n:
    break

  if a <= x[l] - x[i] <= b:
    uf.unite(i, l)
  else:
    continue

  r = bs.bisect_right(x, x[i] + b) - 1
  if r - l >= 1:
    cnt[l] += 1
    cnt[r] -= 1

for i in range(1, n + 1):
  cnt[i] += cnt[i - 1]

for i in range(n - 1):
  if cnt[i] > 0:
    uf.unite(i, i + 1)

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