#include <bits/stdc++.h>
using namespace std;

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

using ll = long long;
using P = pair<ll,ll>;
using graph = vector<vector<int>>;

const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const ll INF = 1LL<<60;
const ll mod = 1000000007LL;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)

template<class T>
struct UnionFind {
    vector<T> par,rank,large;

    void init(T N){
        rank.assign(N,0);
        large.assign(N,1);
        par.resize(N);
        for(T i= 0; i < N; i++){
            par[i]=i;
        }
    }

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

    void unite(T x, T y) {
        T rx = root(x);
        T ry = root(y);
        if (rx == ry) return;
        if(rank[rx]<rank[ry]) {
            par[rx]=ry;
            large[ry]+=large[rx];
            large[rx]=0;
        }
        else {
            par[ry]=rx;
            large[rx]+=large[ry];
            large[ry]=0;
            if(rank[rx]==rank[ry])rank[x]++;
        }
    }

    bool same(T x, T y) {
        T rx = root(x);
        T ry = root(y);
        return rx == ry;
    }

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

int main(){
  ll N,A,B;
  cin>>N>>A>>B;
  vector<ll> v(N);
  rep(i,N) cin>>v[i];
  UnionFind<ll> tree;
  tree.init(N);
  int p=0,q=0;
  rep(i,N){
    int s = lower_bound(v.begin(),v.end(),v[i]+A) - v.begin(),t = upper_bound(v.begin(),v.end(),v[i]+B) - v.begin();
    if(s>=t) continue;
    if(q<=s){
      for(int j = s; j < t; j++){
        tree.unite(i,j);
      }
    }
    else {
      tree.unite(i,i-1);
      for(int j = q; j<t; j++) tree.unite(i,j);
    }
    p=s,q=t;
  }
  rep(i,N){
    printf("%lld\n",tree.size(i));
  }
}