#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; }
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T>& V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> >& Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T>& mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }
template<typename T>vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
/*
 <url:>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */

/*
 UnionFind
 */
struct UnionFind {
    vector<int> data;
    vector<int> left_v,right_v;

    UnionFind(int size) : data(size, -1) {
        left_v.resize(size);
        right_v.resize(size);
        for(int i = 0; i < size;i++) left_v[i] = right_v[i] = i; 
    }

    bool unite(int x, int y) {
        x = root(x); y = root(y);
        if(x == y) return false;
        if (data[x] > data[y]) swap(x, y);
        left_v[x] = min(left_v[x],left_v[y]);
        right_v[x] = max(right_v[x],right_v[y]);
        data[x] += data[y]; 
        data[y] = x;
        return true;
    }

    // 区間[l,r]を結合
    void unite_range(int x,int y){
        if(x > y) return;
        while(right(x) < y){
            unite(right(x),right(x)+1);
        }
    }

    int left(int k){
        return left_v[root(k)];
    }
    int right(int k){
        return right_v[root(k)];
    }
    pair<int,int> range(int k){
        k = root(k);
        return make_pair(left_v[k],right_v[k]);
    }
    bool same(int x, int y) {
        return root(x) == root(y);
    }
    int root(int x) {
        return data[x] < 0 ? x : data[x] = root(data[x]);
    }
    int size(int x) {
        return -data[root(x)];
    }
};

template<class Type>
Type solve(Type res = Type()){
    int N,A,B; cin >> N >> A >> B;
    vector<ll> x(N); for(auto& in:x) cin >> in;

    UnionFind UF(N);
    for(int i = 0; i < N;i++){
        int l = max(0,(int)(lower_bound(x.begin(),x.end(),x[i]+A)-x.begin()));
        int r = min(N-1,(int)(upper_bound(x.begin(),x.end(),x[i]+B)-x.begin()-1));
        UF.unite_range(l,r);
        if(l <= r) UF.unite(i,l);
    }

    for(int i = 0; i < N;i++){
        cout << UF.size(i) << endl;
    }
    return res;
}
int main(void) {
    cin.tie(0); ios::sync_with_stdio(false);
    solve<ll>(0);
    // cout << fixed << setprecision(12) << solve<ll>() << endl;
    return 0;
}