#include <bits/stdc++.h>
#define INF 1000000007
#define rep(i, N) for(ll i = 0; i < N; i++)
#define rep2(i, j, k) for(ll i = j; i < k; i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define print(x) cout << x << "\n"
#define print2(x, y) cout << x << " " << y << "\n"
#define printv(vec) rep(lp, vec.size()) cout << vec[lp] << " "; print(""); 
#define show(x) cerr << #x << " = " << x << "\n";
#define ALL(v) v.begin(), v.end()
#define SUM(v) accumulate(ALL(v), 0)
#define MAX(v) *max_element(ALL(v))
#define MIN(v) *min_element(ALL(v))
#define SORT(v) sort(ALL(v))
#define REV(v) reverse(ALL(v))
#define pb(x) emplace_back(x)
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
typedef long long ll;
using namespace std;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;

const int mod = 998244353;
class mint {
public:
	ll x;
	mint(ll x = 0) : x((x % mod + mod) % mod) {}
	mint operator-() const { 
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += mod - a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= mod;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}
	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}
	mint inv() const {
		return pow(mod - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}
	friend ostream& operator<<(ostream& os, const mint& m){
		os << m.x;
		return os;
	}
};

ll modpow(ll a, ll n){
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = res * a % mod;
		a = a * a % mod;
		n >>= 1;
	}
	return res;
}

struct union_find{

	vl parent;
	vl sizes;

	void init(ll n) {
	rep(i, n) parent.push_back(i);
	rep(i, n) sizes.push_back(1);
	return;
	}

	ll root(ll n){
	if(parent[n] == n) return n;
	return parent[n] = root(parent[n]);
	}

	ll size(ll n) {
	return sizes[root(n)];
	}

	bool is_same(ll a, ll b){
	return root(a) == root(b);
	}

	void unite(ll a, ll b){
	if(is_same(a, b)) return;
	sizes[root(a)] += size(b);
	parent[root(b)] = root(a);
	return;
	}
};


/* 
arg = 0: 「以下」のインデックス
arg = 1: 「未満」のインデックス
arg = 2: 「以上」のインデックス
arg = 3: 「より大きい」のインデックス
*/
ll binary_cnt(vl& v, ll key, ll arg){
	
	if(arg == 0){
		auto itr = upper_bound(ALL(v), key);
		ll num = itr - v.begin();
		return num - 1;
	}
	if(arg == 1){
		auto itr = lower_bound(ALL(v), key);
		ll num = itr - v.begin();
		return num - 1;
	}
	if(arg == 2){
		auto itr = lower_bound(ALL(v), key);
		ll num = v.end() - itr;
		return v.size() - num;
	}
	else{
		auto itr = upper_bound(ALL(v), key);
		ll num = v.end() - itr;
		return v.size() - num;
	}
	
}	

void Main(){

	ll N, A, B;
	cin >> N >> A >> B;
	vl v(N);
	rep(i, N) cin >> v[i];
	vl imos(N + 10);
	union_find uf;
	uf.init(N);
	
	rep(i, N){
		ll l = binary_cnt(v, v[i] + A, 2);
		ll r = binary_cnt(v, v[i] + B, 0);
		if(l > r) continue;
		uf.unite(i, l);
		imos[l] += 1;
		imos[r] -= 1;
	}

	rep(i, N) imos[i + 1] += imos[i];
	rep(i, N - 1) if(imos[i]) uf.unite(i, i + 1);
	rep(i, N) print(uf.size(i));

}

int main(){
	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	ll t = 1;
	//cin >> t;
	rep(i, t) Main();
	return 0;
	
}