import pypyjit
pypyjit.set_param('max_unroll_recursion=-1')
from collections import *
from itertools import *
from functools import *
from heapq import *
import sys,math
input = sys.stdin.readline

N,A,B = map(int,input().split())
X = list(map(int,input().split()))
Q = 2*N
# 頂点数N,追加エッジの個数Q
# 頂点iのインデックスはn+iになる(エッジを追加するときは気にする必要はない)
n = 1
while n < N:
    n *= 2
N3 = 3*n + 1
e = [[] for _ in range(N3+2*Q)]
for i in range(n-1,0,-1):
    
    a = 2*i
    b = 2*i+1
    e[i].append((a,0))
    e[i].append((b,0))
    if n<=a<2*n:
        e[a].append((i+2*n,0))
    else:
        e[a+2*n].append((i+2*n,0))
        
        
    if n<=b<2*n:
        e[b].append((i+2*n,0))
    else:
        e[b+2*n].append((i+2*n,0))

q = 0
def add(l1,r1,l2,r2,c):
    ##[l1,r1)から[l2,r2)にコストcの辺を張る
    global q,e
    source = []
    l1 += n
    r1 += n
    while l1<r1:
        if l1&1:
            if n<=l1<2*n:
                source.append(l1)
            else:
                source.append(l1+2*n)
            l1 += 1
        if r1&1:
            if n<=r1-1<2*n:
                source.append(r1-1)
            else:
                source.append(r1+2*n-1)
        l1 >>= 1
        r1 >>= 1
    
    target = []
    l2 += n
    r2 += n
    while l2<r2:
        if l2&1:
            target.append(l2)
            l2 += 1
        if r2&1:
            target.append(r2-1)
        l2 >>= 1
        r2 >>= 1
    
    for s in source:
        e[s].append((N3+q,0))
    for t in target:
        e[N3+q+1].append((t,0))
    
    e[N3+q].append((N3+q+1,c))
    q += 2
    return
        
for i in range(N):
    
    xi = X[i]
    l = N
    ng = i
    while l-ng>1:
        
        mid = (l+ng)//2
        
        if X[mid]>=A+xi:
            
            l = mid
        else:
            
            ng = mid
            
            
    r = i
    ng = N
    while ng-r>1:
        mid = (ng+r)//2
        
        if X[mid]<=xi+B:
            r = mid
        else:
            ng = mid
    r += 1
    add(i,i+1,l,r,1)
    add(l,r,i,i+1,1)
            

        
visited = [False]*(N3+2*Q)
ans = [1]*(N3+2*Q)

for i in range(N):
    
    if visited[i+n]:
        continue
    
    visited[i+n]=True
    v = deque()
    v.append(i+n)
    target = deque()
    target.append(i+n)
    cnt = 1
    while v:
        
        x = v.popleft()
        
        for ix,_ in e[x]:
            
            if visited[ix]:
                continue
            visited[ix] = True
            if n<=ix<n+N:
                cnt += 1
                target.append(ix)
            v.append(ix)
    
    while target:
        y = target.pop()
        ans[y] = cnt
        
        
print(*ans[n:n+N],sep='\n')