#line 1 "a.cpp"
#include<iostream>
#include<algorithm>
using namespace std;
#line 1 "/home/kotatsugame/library/datastructure/UF.cpp"
#include<vector>
struct UF{
	int n;
	vector<int>parent,rank;
	UF(int n_=0):n(n_),parent(n_),rank(n_,1)
	{
		for(int i=0;i<n_;i++)parent[i]=i;
	}
	int find(int a){return parent[a]!=a?parent[a]=find(parent[a]):a;}
	bool same(int a,int b){return find(a)==find(b);}
	bool unite(int a,int b)
	{
		a=find(a),b=find(b);
		if(a==b)return false;
		if(rank[a]<rank[b])
		{
			parent[a]=b;
			rank[b]+=rank[a];
		}
		else
		{
			parent[b]=a;
			rank[a]+=rank[b];
		}
		return true;
	}
	int size(int a){return rank[find(a)];}
};
#line 5 "a.cpp"
int N,A,B;
int X[2<<17];
int cnt[2<<17];
main()
{
	cin>>N>>A>>B;
	for(int i=0;i<N;i++)cin>>X[i];
	UF uf(N);
	for(int i=0;i<N;i++)
	{
		{
			int l=lower_bound(X,X+N,X[i]+A)-X;
			int r=lower_bound(X,X+N,X[i]+B+1)-X;
			if(l<r)
			{
				uf.unite(i,l);
				cnt[l]++;
				cnt[r-1]--;
			}
		}
		{
			int l=lower_bound(X,X+N,X[i]-B)-X;
			int r=lower_bound(X,X+N,X[i]-A+1)-X;
			if(l<r)
			{
				uf.unite(i,l);
				cnt[l]++;
				cnt[r-1]--;
			}
		}
	}
	for(int i=0;i<N;i++)
	{
		cnt[i+1]+=cnt[i];
		if(cnt[i]>0)uf.unite(i,i+1);
	}
	for(int i=0;i<N;i++)cout<<uf.size(i)<<endl;
}