import java.io.*;
import java.util.*;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int a = sc.nextInt();
        int b = sc.nextInt();
        int[] values = new int[n + 1];
        for (int i = 0; i < n; i++) {
            values[i] = sc.nextInt();
        }
        values[n] = Integer.MAX_VALUE;
        UnionFindTree uft = new UnionFindTree(n);
        int left = 0;
        int right = 0;
        for (int i = 0; i < n; i++) {
            while (values[left] - values[i] < a) {
                left++;
            }
            while (values[right] - values[i] <= b) {
                right++;
            }
            for (int j = left; j < right; j++) {
                uft.unite(i, j);
            }
        }
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < n; i++) {
            sb.append(uft.getCount(i)).append("\n");
        }
        System.out.print(sb);
    }
    
    static class UnionFindTree {
        int[] parents;
        int[] counts;
        
        public UnionFindTree(int size) {
            parents = new int[size];
            counts = new int[size];
            for (int i = 0; i < size; i++) {
                parents[i] = i;
                counts[i] = 1;
            }
        }
        
        public int find(int x) {
            if (x == parents[x]) {
                return x;
            } else {
                return parents[x] = find(parents[x]);
            }
        }
        
        public boolean same(int x, int y) {
            return find(x) == find(y);
        }
        
        public void unite(int x, int y) {
            int xx = find(x);
            int yy = find(y);
            if (xx == yy) {
                return;
            }
            parents[yy] = xx;
            counts[xx] += counts[yy];
        }
        
        public int getCount(int x) {
            return counts[find(x)];
        }
    }
    
    static class Path implements Comparable<Path> {
        int cost;
        int left;
        int right;
        
        public Path(int cost, int left, int right) {
            this.cost = cost;
            this.left = left;
            this.right = right;
        }
        
        public int compareTo(Path another) {
            return cost - another.cost;
        }
    }
}

class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public double nextDouble() throws Exception {
        return Double.parseDouble(next());
    }
    
    public String next() throws Exception {
        if (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
}