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

//template
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
//end

struct UnionFind{
   vector<int> par; int n;
   UnionFind(){}
   UnionFind(int _n):par(_n,-1),n(_n){}
   int root(int x){return par[x]<0?x:par[x]=root(par[x]);}
   bool same(int x,int y){return root(x)==root(y);}
   int size(int x){return -par[root(x)];}
   bool unite(int x,int y){
      x=root(x),y=root(y); if(x==y)return false;
      if(size(x)>size(y))swap(x,y);
      par[y]+=par[x]; par[x]=y; n--; return true;
   }
};

int main(){
   int n,x,y; cin>>n>>x>>y;
   vector<int> a(n);
   rep(i,0,n)cin>>a[i];
   vector<int> rui(n,0); UnionFind uni(n);
   rep(i,0,n){
      int lb=lower_bound(ALL(a),a[i]+x)-a.begin();
      int rb=upper_bound(ALL(a),a[i]+y)-a.begin()-1;
      if(lb>rb)continue;
      uni.unite(i,lb);
      rui[lb]++; rui[rb]--;
   }
   rep(i,0,n-1)rui[i+1]+=rui[i];
   rep(i,0,n-1)if(rui[i])uni.unite(i,i+1);
   rep(i,0,n)cout<<uni.size(i)<<endl;
   return 0;
}