#include <bits/stdc++.h>
#include "atcoder/all"
#define debug cout << "OK" << endl;
template<typename T>
inline bool chmax(T& a, const T b) { if (a < b) { a = b; return true; } return false; }
template<typename T>
inline bool chmin(T& a, const T b) { if (a > b) { a = b; return true; } return false; }
inline int Code(char c) {
	if ('A' <= c and c <= 'Z')return (int)(c - 'A');
	if ('a' <= c and c <= 'z')return (int)(c - 'a');
	if ('0' <= c and c <= '9')return (int)(c - '0');
	assert(false);
}
using namespace std;
using namespace atcoder;
#define int long long
constexpr int MOD = 998244353;
constexpr int INF = (1LL << 62);
using minit = modint998244353;

template<typename T>
ostream& operator << (ostream& st, const vector<T> &v) {
	for (const T value : v) {
		st << value << " ";
	}
	return st;
}
template<typename T>
istream& operator >> (istream& st, vector<T>& v) {
	for (T &value : v) {
		st >> value;
	}
	return st;
}

//

//

void solve() {
	int N, A, B;
	cin >> N >> A >> B;
	vector<int> x(N);
	cin >> x;
	dsu d(N);
	vector<int> imos(N , 0);
	for (int i = 0; i < N; i++) {
		auto l = lower_bound(x.begin(), x.end(), x[i] + A);
		auto r = upper_bound(x.begin(), x.end(), x[i] + B);
		if (l == r)goto next;
		else r--;
		imos[distance(x.begin(), l)]++, imos[distance(x.begin(), r)]--, d.merge(i, distance(x.begin(), l));
	next:;
		l = lower_bound(x.begin(), x.end(), x[i] - B);
		r = upper_bound(x.begin(), x.end(), x[i] - A);
		if (l == r)continue;
		else r--;
		imos[distance(x.begin(), l)]++, imos[distance(x.begin(), r)]--, d.merge(i, distance(x.begin(), l));
	}
	for (int i = 0; i < N - 1; i++)imos[i + 1] += imos[i];
	for (int i = 0; i < N - 1; i++)if (imos[i])d.merge(i, i + 1);
	for (int i = 0; i < N; i++) {
		cout << d.size(i) << endl;
	}
}
signed main() {
	int T = 1;
	// cin >> T;
	for (int i = 0; i < T; i++)
		solve();
	return 0;
}

/*
* わらびのコードこーどすぺーす
 (σ･∀･)σｹﾞｯﾂ!!
*/