import bisect
from collections import deque

def main():
    import sys
    input = sys.stdin.read
    data = input().split()
    
    n = int(data[0])
    A = int(data[1])
    B = int(data[2])
    x = list(map(int, data[3:3 + n]))
    
    visited = [False] * n
    ans = [0] * n
    
    for i in range(n):
        if not visited[i]:
            queue = deque()
            component = []
            queue.append(i)
            visited[i] = True
            component.append(i)
            while queue:
                u = queue.popleft()
                # Check left adjacency
                min_x_left = x[u] - B
                max_x_left = x[u] - A
                left_start = bisect.bisect_left(x, min_x_left)
                left_end = bisect.bisect_right(x, max_x_left)
                for j in range(left_start, left_end):
                    if j != u and not visited[j]:
                        visited[j] = True
                        component.append(j)
                        queue.append(j)
                # Check right adjacency
                min_x_right = x[u] + A
                max_x_right = x[u] + B
                right_start = bisect.bisect_left(x, min_x_right)
                right_end = bisect.bisect_right(x, max_x_right)
                for j in range(right_start, right_end):
                    if j != u and not visited[j]:
                        visited[j] = True
                        component.append(j)
                        queue.append(j)
            size = len(component)
            for node in component:
                ans[node] = size
    
    for a in ans:
        print(a)

if __name__ == "__main__":
    main()