#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
struct UnionFind {
    vector<int> par, size;
    UnionFind(int x) {
        par.resize(x);
        size.resize(x, 1);
        for(int i = 0; i < x; i++) {
            par[i] = i;
        }
    }
    int find(int x) {
        if (par[x] == x)
            return x;
        return par[x] = find(par[x]);
    }
    bool same(int x, int y) {
        return find(x) == find(y);
    }
    int consize(int x) {
        return size[find(x)];
    }
    void unite(int x, int y) {
        x = find(x);
        y = find(y);
        if (x == y)
            return;
        if (size[x] < size[y]) {
            par[x] = y;
            size[y] += size[x];
        }
        else {
            par[y] = x;
            size[x] += size[y];
        }
    }
};
signed main() {
    int N,A,B;
    cin >> N >> A >> B;
    vector<int>x(N);
    UnionFind uf(N);
    for(int i = 0; i < N; i++) {
        cin >> x[i];
    }
    int X = 0,Y = 0;
    sort(x.begin(),x.end());
    for(int i = 0; i < N; i++) {
        if(i == 0) {
            X = lower_bound(x.begin(),x.end(),x[i]+A)-x.begin();
            Y = upper_bound(x.begin(),x.end(),x[i]+B)-x.begin()-1;
        }
        else {
            int l = X-1,r = N;
            while(l+1 < r) {
                int mid = (l+r)/2;
                if(x[mid] < x[i]+A) {
                    l = mid;
                }
                else {
                    r = mid;
                }
            }
            X = l+1;
            r = N;
            while (l+1 < r) {
                int mid = (l+r)/2;
                if(x[mid] > x[i]+B) {
                    r = mid;
                }
                else {
                    l = mid;
                }
            }
            Y = r-1;
        }
        int l = X,r = Y;
        while(l+1 < r) {
            int mid = (l+r)/2;
            if(uf.same(i,mid)) {
                l = mid;
            }
            else {
                r = mid;
            }
        }
        X = l;
        for(int j = X; j <= Y; j++) {
            if(!uf.same(i,j)) {
                uf.unite(i,j);
            }
        }
        if(uf.consize(i) == N) {
            break;
        }
    }
    for(int i = 0; i < N; i++) {
        cout << uf.consize(i) << endl;
    }
}