#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;

struct Unionfind{
    vector<int> parents;
    int n;
    Unionfind(int n):n(n),parents(n,-1){ }

    int find(int x){
        if(parents[x] < 0) return x;
        else return parents[x] = find(parents[x]);
    }

    void unite(int x,int y){
        x = find(x);
        y = find(y);

        if(x==y) return;
        if(parents[x] > parents[y]) swap(x,y);
        parents[x] += parents[y];
        parents[y] = x;
    }  

   int size(int x){
       return -parents[find(x)];
   }

   bool same(int x,int y){
       return find(x)==find(y);
   }

   vector<int> members(int x){
       int root = find(x);
       vector<int> member;
       for(int i=0;i<n;i++){
           if(find(i)==root ){
               member.push_back(i);
           }
       }
      return member;
  }

  int group_cnt(){
      int c = 0;
      rep(i,n){
          if(parents[i] < 0) ++c;
      }
      return c;
  }
};

int main(){
    int n,a,b;
    cin >> n >> a >> b;
    Unionfind uf(n);

    vector<int> x(n);
    rep(i,n) cin >> x[i];
    rep(i,n-1){
        bool find = false;
        auto it1 = lower_bound(x.begin(),x.end(),x[i+1]-b);
        auto it2 = lower_bound(x.begin(),x.end(),x[i+1]+a);
        //cout << it1-x.begin() << " " << it2-x.begin() << endl;
        if(it1!=x.end()){
            if(*it1 <= x[i]-a) find = true;
        }
        if(it2!=x.end()){
            if(*it2 <= x[i]+b) find = true;
        }
        if(find){
            uf.unite(i,i+1);
        }
    }
    /*
    rep(i,n){
        cout << uf.size(i) << endl;
    }
    */
    rep(i,n){
        auto it1 = lower_bound(x.begin(),x.end(),x[i]+a);
        auto it2 = lower_bound(x.begin(),x.end(),x[i]-b);
        if(it1!=x.end()){
            if(*it1 <= x[i]+b) uf.unite(i,it1-x.begin());
        }
        if(it2!=x.end()){
            if(*it2 <= x[i]-a) uf.unite(i,it2-x.begin());
        }
    }
    rep(i,n) cout << uf.size(i) << endl;
    return 0;
}