#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;

#include <iostream>
#include <vector>
#include <map>
#include <algorithm>

using namespace std;

int main(){
  ll n,a,b;
  cin>>n>>a>>b;
  
  vector<ll> A(n,0),B(n,0);
  rep(i,n) cin>>A[i];
  
  ll k=0;
  rep(i,n){
    auto it1=lower_bound(ALL(A),A[i]+a);
    auto it2=upper_bound(ALL(A),A[i]+b);
    if(it1<it2){
      for(auto j=it1;j<it2;j++){
        if(B[j-A.begin()]!=0){
          B[i]=B[j-A.begin()];
          break;
        }
      }
    }
    
    if(B[i]==0){
      B[i]=++k;
    }
    if(it1<it2){
      for(auto j=it1;j<it2;j++){
        B[j-A.begin()]=B[i];
      }
    }
  }
  
  map<int,int> m;
  rep(i,n){
    m[B[i]]++;
  }
  
  rep(i,n){
    cout<<m[B[i]]<<endl;
  }

  return 0;
}