//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
#define ROF(i,a,b) for(int i=a;i>=b;i--)
#define per(i,a) ROF(i,a,0)
#define pb push_back
using namespace std;
using ll=long long;
using ld=long double;
using ch=char;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
const ll MOD=1000000007;
const ll MOD2=998244353;
const ld PI=acos(-1);
const ll INF=1e18;
struct edge{ll to,cost;};
struct edge2{ll from,to,cost;};

template <typename T>
bool chmax(T &a, const T& b) {
    if (a < b) {
      a = b;
        return true;
    }
    return false;
}

template <typename T>
bool chmin(T &a, const T& b) {
    if (a > b) {
      a = b;
      return true;
    }
    return false;
}
struct UnionFind {
    vector<int> par;
    vector<int> rnk;
    vector<int> siz;
    UnionFind(int N):par(N),rnk(N),siz(N){
        for (int i=0;i<N;i++){
            par[i]=i,rnk[i]=0,siz[i]=1;
        }
    }
    //根
    int find(int x){
        if(par[x]==x) return x;
        return par[x]=find(par[x]);
    }
    void unite(int x,int y){
        int rx=find(x);
        int ry=find(y);
        if (rx==ry) return;
        if(rnk[rx]<rnk[ry]){
            par[rx]=ry;
            siz[ry]+=siz[rx];
            siz[rx]=0;
        }
        else{
            par[ry]=rx;
            siz[rx]+=siz[ry];
            siz[ry]=0;
            if(rnk[rx]==rnk[ry]){
                rnk[rx]++;
            }
        }
    }
    //集合が同じか
    bool same(int x,int y){
        return find(x)==find(y);
    }
    //集合の大きさ
    int size(int x){
        return siz[find(x)];
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N,A,B;
    cin >> N >> A >> B;
    vl X(N);
    rep(i,N){
        cin >> X[i];
    }
    X.pb(INF);
    UnionFind uf(N);
    vl d(N,0);
    rep(i,N){
        int l=lower_bound(X.begin(),X.end(),X[i]+A)-X.begin();
        int r=upper_bound(X.begin(),X.end(),X[i]+B)-X.begin()-1;
        if(l>r)continue;
        uf.unite(i,l);
        d[l]++;d[r]--;
    }
    rep(i,N-1){
        d[i+1]=d[i]+d[i+1];
    }
    rep(i,N-1){
        if(d[i]>0){
            uf.unite(i,i+1);
        }
    }
    rep(i,N){
        cout << uf.size(i) << endl;
    }
}
/*
overflow checked?
corner case checked?
boundary checked?
not TLE in worst case checked?
*/