import bisect
class Unionfind:
     
    def __init__(self,n):
        self.uf = [-1]*n
 
    def find(self,x):
        if self.uf[x] < 0:
            return x
        else:
            self.uf[x] = self.find(self.uf[x])
            return self.uf[x]
 
    def same(self,x,y):
        return self.find(x) == self.find(y)
 
    def union(self,x,y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return False
        if self.uf[x] > self.uf[y]:
            x,y = y,x
        self.uf[x] += self.uf[y]
        self.uf[y] = x
        return True
 
    def size(self,x):
        x = self.find(x)
        return -self.uf[x]

n,a,b = map(int,input().split())
x = [-float("INF")] + list(map(int,input().split())) + [float("INF")]
u = Unionfind(n+1)
imos = [0]*(n+2)
for i in range(1,n+1):
    l = bisect.bisect_left(x,x[i]+a)
    r = bisect.bisect_right(x,x[i]+b)
    if r > l:
        u.union(i,l)
        imos[l] += 1
        imos[r-1] -= 1

for i in range(1,n+1):
    imos[i] += imos[i-1]
    if imos[i] > 0:
        u.union(i,i+1)

for i in range(1,n+1):
    print(u.size(i))