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] def group_count(self): return len(self.roots()) def all_group_members(self): return {r: self.members(r) for r in self.roots()} def __str__(self): return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots()) N,A,B = map(int,input().split()) X = list(map(int,input().split())) + [10**10] uf = UnionFind(N) l = 0 r = 0 ans = [0] * N for i in range(N): x = X[i] while X[r] - x <= B: r += 1 while X[l] - x < A: l += 1 for j in range(l,r): uf.union(i,j) l = max(0,r-2) ans = [0] * N for i in range(N): ans[i] = uf.size(i) for a in ans: print(a)