#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<utility>
#include<set>
#include<map>
#include<queue>

using namespace std;

#define int long long
#define endl "\n"

constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007; 

struct fast_io {
	fast_io(){
		std::cin.tie(nullptr);
		std::ios::sync_with_stdio(false);
	};
} fio;



signed main(){
	cout<<fixed<<setprecision(10);
	
	int count = 1;
	int N, A, B;
	vector<int> x;
	vector<int> used;
	set<int> s;
	map<int,int> mp;
	map<int,int> num;
	map<int,int> table;
	
	cin>>N>>A>>B;
	
	x.resize(N);
	used.resize(N);
	
	for(int i = 0; i < N; i++){
		
		cin>>x[i];
		
		s.insert(x[i]);
		
		table[x[i]] = i;
	}
	
	for(int i = 0; i < N; i++){
		if(s.count(x[i]) == 0) continue;
		
		queue<int> Q;
		
		int sum = 0;
		
		Q.push(i);
		
		s.erase(x[i]);
		
		while(!Q.empty()){
			int z = Q.front(); Q.pop();
			int v = x[z];
			
			sum++;
			
			num[z] = count;
			
			for(auto it = s.lower_bound(v - B); it != s.end();){
				
				if(v - A < *it) break;
				
				Q.push(table[*it]);
				
				it = s.erase(it);
			}
			
			for(auto it = s.lower_bound(v + A); it != s.end();){
				
				if(v + B < *it) break;
				
				Q.push(table[*it]);
				
				it = s.erase(it);
			}
		}
		
		mp[count] = sum;
		
		count++;
	}
	
	for(int i = 0; i < N; i++){
		cout<<mp[num[i]]<<endl;
	}
	
	return 0;
}