import sys
from bisect import bisect_left, bisect_right

def main():
    input = sys.stdin.read().split()
    idx = 0
    N = int(input[idx]); idx +=1
    A = int(input[idx]); idx +=1
    B = int(input[idx]); idx +=1
    x = list(map(int, input[idx:idx+N]))
    parent = list(range(N))
    size = [1]*N

    def find(u):
        while parent[u] != u:
            parent[u] = parent[parent[u]]
            u = parent[u]
        return u

    def union(u, v):
        u_root = find(u)
        v_root = find(v)
        if u_root == v_root:
            return
        if size[u_root] < size[v_root]:
            u_root, v_root = v_root, u_root
        parent[v_root] = u_root
        size[u_root] += size[v_root]

    for i in range(N):
        xi = x[i]
        left = xi + A
        right_val = xi + B
        l = bisect_left(x, left)
        r = bisect_right(x, right_val) - 1
        if l > r:
            continue
        # Connect to l and r
        if l < N:
            union(i, l)
        if r >=0 and r != l:
            union(i, r)

    # After all unions, find the root for each i and output the size
    result = []
    for i in range(N):
        root = find(i)
        result.append(str(size[root]))
    
    print('\n'.join(result))

if __name__ == '__main__':
    main()