#pragma GCC optimize("Ofast", "unroll-loops")

#include <bits/stdc++.h>

using namespace std;

struct UnionFind {
	vector<int> data;

	UnionFind(int sz) { data.assign(sz, -1); }

	bool unite(int x, int y) {
		x = find(x); y = find(y);
		if (x == y) return false;
		if (data[x] > data[y]) swap(x, y);
		data[x] += data[y];
		data[y] = x;
		return true;
	}

	int find(int k) {
		if (data[k] < 0) return k;
		return data[k] = find(data[k]);
	}

	int size(int k) { return -data[find(k)]; }
};

int N, A, B;
vector<int> x;

void input(void) {
	cin >> N >> A >> B;
	x.resize(N);
	for (int& xi : x)
		cin >> xi;
}

vector<int> solve(void) {
	UnionFind uf(N);
	vector<int> right_most(N);

	for (int i = 0; i < N; ++i)
		right_most[i] = i;
	
	for (int i = 0; i < N; ++i) {
		auto iter1 = lower_bound(
			x.begin(), x.end(), x[i] + A
		);
		
		if (iter1 == x.end()) break;
		
		if ((*iter1) - x[i] > B) continue;
		auto iter2 = upper_bound(
			x.begin(), x.end(), x[i] + B
		);
		
		int l = iter1 - x.begin();
		int r = iter2 - x.begin() - 1;

		uf.unite(i, l);

		int j = l;
		while (true) {
			int tmp = right_most[j];
			if (tmp >= r) break;
			right_most[j] = r;
			j = tmp;
			uf.unite(j, j + 1);
			++j;
		}
	}

	vector<int> ret(N);
	for (int i = 0; i < N; ++i)
		ret[i] = uf.size(i);

	return ret;
}

int main(void) {
	input();
	vector<int> ans = solve();
	for (int i : ans)
		cout << i << endl;
	return 0;
}