#include <bits/stdc++.h>

using ll = long long;
using namespace std;
const int INFint = 1e9+1;
const ll INFll = (ll)1e18+1;
ll MOD=1e9+7;

struct UnionFind{
  vector<int> par;
  vector<int> size_a;

  UnionFind(int N): par(N),size_a(N){
    for(int i=0;i<N;i++){
      par[i]=i;
      size_a[i] = 1;
    }
  }

  int root(int x){
    if(par[x]==x) return x;
    else return par[x]=root(par[x]);
  }

  void unite(int x,int y){
    int rx=root(x);
    int ry=root(y);
    if(rx!=ry){
      par[rx]=ry;
      size_a[ry] += size_a[rx];
      size_a[rx] = 0;
    }
  }

  bool sameroot(int x,int y){
    return root(x)==root(y);
  }

  int size(int x){
    return size_a[root(x)];
  }
};

int main(){
  ll N,A,B;
  cin>>N>>A>>B;
  vector<ll> x(N);
  for(int i(0);i<N;i++){
    cin>>x[i];
  }
  UnionFind uf(N);
  int fmi(0);
  for(int i(0);i<N;i++){
    int h = x[i]+A,m = x[i]+B;
    int hi = lower_bound(x.begin(),x.end(),h) - x.begin();
    int mi = upper_bound(x.begin(),x.end(),m) - x.begin();
    // cout << "a";
    // cout << hi << " " << mi << endl;
    for(int j(max(hi,fmi-1));j<mi;j++){
      //cout << i << " " << j << endl;
      uf.unite(i,j);
    }
    fmi = mi;
  }
  for(int i(0);i<N;i++){
    cout << uf.size(i) << endl;
  }
  return 0;
}