#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;

class UnionFind{
private:
    vec<int> p,s;
    int cnt;
public:
    UnionFind(){}
    UnionFind(int N):cnt(N),s(N,1),p(N){
        iota(p.begin(),p.end(),0);
    }
    int find(int x){
        if(p[x]==x) return x;
        else return p[x] = find(p[x]);
    }
    void unite(int x,int y){
        x = find(x); y = find(y);
        if(x==y) return;
        if(s[x]>s[y]) swap(x,y);
        p[x] = y;
        s[y] += s[x];
        cnt--;
    }
    bool is_same_set(int x,int y) {return find(x)==find(y);}
    int size(int x) {return s[find(x)];}
    int compnents_number(){return cnt;}
};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N,A,B;
    cin >> N >> A >> B;
    vec<int> X(N);
    for(auto& x:X) cin >> x;
    UnionFind uf(N);
    int l = 0,r = 0;
    for(int i=0;i<N;i++){
        if(l<i) l = i;
        while(l<N && abs(X[i]-X[l])<A){
            l++;
        }
//        cerr << i << " " << l << "\n";
        if(l==N) break;
        if(r<l) r = l+1;
        if(abs(X[i]-X[l])>B) continue;
        uf.unite(i,l);
        while(r<N && abs(X[i]-X[r])<=B){
            uf.unite(i,r);
            r++;
        }
    }
    for(int i=0;i<N;i++) cout << uf.size(i) << "\n";
}