#include <bits/stdc++.h>
using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
//typedef vector<vector<ll>> Graph;

const ll mod = 1e9 + 7;
//const ll mod = 998244353;

#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define spa << " " <<
#define fi first
#define se second

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }

template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){
os << "(" << v.first << ", " << v.second << ")"; return os;
}
template<class T> ostream& operator << (ostream& os, const vector<T> v){
for(int i = 0; i < (int)v.size(); i++){if(i > 0){os << " ";} os << v[i];} return os;
}
template<class T> ostream& operator << (ostream& os, const vector<vector<T>> v){
for(int i = 0; i < (int)v.size(); i++){if(i > 0){os << endl;} os << v[i];} return os;
}

template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<endl;}};
template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];
for(ll i=1;i<n;i++)cerr spa v[i];
cerr<<endl;};

struct UnionFindSize {
    vector<int> par;
    
    UnionFindSize(int n) : par(n, -1) { }
    void init(int n) { par.assign(n, -1); }
    
    int root(int x) {
        if (par[x] < 0) return x;
        else return par[x] = root(par[x]);
    }
    
    bool issame(int x, int y) {
        return root(x) == root(y);
    }
    
    bool merge(int x, int y) {
        x = root(x); y = root(y);
        if (x == y) return false;
        if (par[x] > par[y]) swap(x, y); // merge technique
        par[x] += par[y];
        par[y] = x;
        return true;
    }
    
    int size(int x) {
        return -par[root(x)];
    }

    void print(){
		cout << "uf: ";
		for(int i=0;i<(int)par.size();i++) cout << root(i) << " ";
		cout << endl;
	}
};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll N, A, B;
    cin >> N >> A >> B;
    vl x(N);
    REP(i, N) cin >> x[i];

    UnionFindSize uf(N);

    REP(i, N){
        ll pos = lower_bound(x.begin(), x.end(), x[i]+A) - x.begin();
        if(pos<N and x[pos]<=x[i]+B){
            uf.merge(i, pos);
        }

        pos = lower_bound(x.begin(), x.end(), x[i]-B) - x.begin();
        if(pos<N and x[pos]<=x[i]-A){
            uf.merge(i, pos);
        }
    }

    REP(i, N-1){
        ll pos = lower_bound(x.begin(), x.end(), x[i]-B) - x.begin();
        if(pos<N and x[pos]<=x[i]-A and x[pos]>=x[i+1]-B and x[pos]<=x[i+1]-A){
            uf.merge(i, i+1);
            // dump(x[pos])
            // dump(1)
            // dump(i)
        }

        pos = lower_bound(x.begin(), x.end(), x[i+1]+A) - x.begin();
        if(pos<N and x[pos]<=x[i+1]+B and x[pos]>=x[i]+A and x[pos]<=x[i]+B){
            uf.merge(i, i+1);
            // dump(2)
            // dump(i)
        }
    }

    REP(i, N){
        cout << uf.size(i) << "\n";
    }

    return 0;
}