from bisect import bisect_left, bisect_right class UnionFind: def __init__(self, n): self.n = n self.parents = [-1] * n self.group = 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 self.group -= 1 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 self.group def all_group_members(self): dic = {r:[] for r in self.roots()} for i in range(self.n): dic[self.find(i)].append(i) return dic 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())) imos = [0] * (n + 1) UF = UnionFind(n) for i, x in enumerate(X): ll = bisect_left(X, x + a) rr = bisect_right(X, x + b) if ll != rr: UF.union(i, ll) UF.union(i, rr - 1) imos[ll] += 1 imos[rr - 1] -= 1 tot = 0 for i in range(1, n + 1): imos[i] += imos[i - 1] for i in range(n): print(UF.size(i))