#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
#include <random>
#include <unordered_map>
#include <unordered_set>
#define all(a) a.begin(),a.end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pb push_back
#define debug(x) cerr << #x << ':' << (x) << '\n'
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef complex<ld> com;
constexpr int inf = 1000000010;
constexpr ll INF = 1000000000000000010;
constexpr ld eps = 1e-12;
constexpr ld pi = 3.141592653589793238;
template<class T, class U> inline bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T &a, const U &b) { if (a > b) { a = b; return true; } return false; }

class unionfind {
	vector<int> par;
	vector<int> sz;
	vector<bool> flag;
public:
	unionfind(int n) {
		par = vector<int>(2 * n);
		for (int i = 0; i < 2 * n; i++) par[i] = i;
		sz = vector<int>(2 * n);
		for (int i = n; i < 2 * n; i++) sz[i] = 1;
		flag = vector<bool>(n);
	}
	int find(int x) {
		if (par[x] == x) return x;
		else return par[x] = find(par[x]);
	}
	int si(int x) { return sz[find(x)]; }
	bool same(int x, int y) { return find(x) == find(y); }
	void add(int v) {
		int n = flag.size();
		if (v >= n || flag[v]) return;
		flag[v] = true;
		unite(v, v << 1); unite(v, v << 1 | 1);
		add(v << 1); add(v << 1 | 1);
	}
	void unite(int x, int y) {
		add(y);
		x = find(x);
		y = find(y);
		if (x == y) return;
		if (sz[x] < sz[y]) {
			par[x] = y;
			sz[y] += sz[x];
		}
		else {
			par[y] = x;
			sz[x] += sz[y];
		}
	}
};

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout << fixed << setprecision(20);

	int n, a, b;
	cin >> n >> a >> b;
	int sz = 1;
	while (sz < n) sz <<= 1;
	unionfind uni(sz);
	vector<int> x(n);
	rep(i, n) cin >> x[i];
	for (int i = 0; i < n; i++) {
		int r1 = lower_bound(all(x), x[i] + a) - x.begin();
		int r2 = upper_bound(all(x), x[i] + b) - x.begin();
		r1 += sz; r2 += sz;
		while (r1 < r2) {
			if (r1 & 1) uni.unite(i + sz, r1++);
			if (r2 & 1) uni.unite(i + sz, --r2);
			r1 >>= 1; r2 >>= 1;
		}
	}
	rep(i, n) cout << uni.si(i + sz) << '\n';
}