#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep_lr(i,l,r) for(int i=(l);i<(r);i++)
#define all(x) (x).begin(),(x).end()
#define V vector
typedef V<int> vi;
typedef V<vi> vvi;
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<int, int, int> T;
constexpr int INF = INT_MAX >> 1;
constexpr ll LINF = 5000000000000000LL;
constexpr int MOD = 1000000007;

struct UnionFind {

	vi data;

	UnionFind(int n = 0) {
		data.assign(n, -1);
	}

	int find(int k) {
		if (data[k] < 0) return k;
		return data[k] = find(data[k]);
	}
	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;
	}
	bool same(int x, int y) { return find(x) == find(y); }
	int size(int k) { return -data[find(k)]; }

};

int main() {
	
	int n, a, b;
	cin >> n >> a >> b;
	vi x(n);
	rep(i, n)cin >> x[i];

	UnionFind uf(n);

	rep(i, n) {
		int st = lower_bound(all(x), x[i] + a) - x.begin();
		int gl = upper_bound(all(x), x[i] + b) - x.begin();
		rep_lr(j, st, gl) {
			if(!uf.same(i,j))uf.unite(i, j);
		}
	}
	
	rep(i, n)cout << uf.size(i) << endl;

}