#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);


	int N, A, B;
	cin >> N >> A >> B;

	set<ll> X;
	rep1(i, N) {
		ll x;
		cin >> x;
		X.insert((x << 30) + i);
	}

	int ma = (1 << 30) - 1;
	int kotae[200001];

	while (X.size()) {
		queue<ll> q;
		int k = 0;
		vector<int> v;
		auto tmp = *X.begin();
		X.erase(tmp);
		q.push(tmp);

		while (q.size()) {
			auto tmp = q.front();
			q.pop();
			ll x = tmp >> 30;
			int i = tmp & ma;
			k++;
			v.pb(i);
			auto l = X.lower_bound(x - B << 30);
			auto r = X.lower_bound(x - A + 1 << 30);
			while (l != r) {
				q.push(*l);
				l++;
			}
			X.erase(X.lower_bound(x - B << 30), r);
			l = X.lower_bound(x + A << 30);
			r = X.lower_bound(x + B + 1 << 30);
			while (l != r) {
				q.push(*l);
				l++;
			}
			X.erase(X.lower_bound(x + A << 30), r);
		}
		for (auto j : v) kotae[j] = k;
	}
	
	rep1(i, N) co(kotae[i]);

	Would you please return 0;
}