#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector<ll> >
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
typedef long double ld;
typedef complex<double> comp;
const ll inf=1e9+7;
const ll mod=2e5+3;
const int MAX=1000010;

int siz[200010];
int par[200010];
int depth[200010];
void init(int n){
  for(int i=0;i<=n;i++){
      par[i]=i;
      depth[i]=0;
  }
  rep(i,n+1){
      siz[i]=1;
  }
}
int root(int x){
  return par[x]==x?x:par[x]=root(par[x]);
}
bool same(int x,int y){
  return root(x)==root(y);
}
void unite(int x,int y){
  x=root(x);
  y=root(y);
  ll sx=siz[x];
  ll sy=siz[y];
  if(x==y)return;
  if(depth[x]<depth[y]){
      par[x]=y;
  }else{
      par[y]=x;
      if(depth[x]==depth[y])depth[x]++;
  }
  siz[root(x)]=sx+sy;
}
ll a,b;
signed main(){
    ll n;cin>>n>>a>>b;
    vector<ll>x(n);
    vector<ll>c(n);
    init(n);
    rep(i,n)cin>>x[i];
    x.pb(inf);
    rep(i,n){
        ll l=lower_bound(all(x),x[i]+a)-x.begin();
        ll r=upper_bound(all(x),x[i]+b)-x.begin();
        if(r==l)continue;
        if(l<n)unite(l,i);
        r--;
        r=max(r,l);
        c[l]++;
        if(r>=0&&r<n){
            c[r]--;
        }
    }
    rep(i,n-1){
        c[i+1]+=c[i];
        if(c[i]){
            unite(i,i+1);
        }
    }
    rep(i,n){
        cout<<siz[root(i)]<<endl;
    }
}