#include <bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pb push_back
using vi = vector <int>;
using ll = long long;
using pii = pair <int, int>;
const ll mod = 998244353;
//~ const ll mod = 1e9 + 7;
ll qpow(ll a, ll b, ll m = mod) { ll r = 1, t = a;
	for(; b; b /= 2) { if(b & 1) r = r * t % m; t = t * t % m; } return r; }

const int N = 2e5 + 11;
int p[N], ans[N];
int root[N];

const int inf = 2e9;

int main() {
	ios :: sync_with_stdio(false);
	
	int n, a, b; cin >> n >> a >> b;
	
	set <pii> s;
	for(int i = 1; i <= n; i ++) {
		cin >> p[i];
		s.insert({p[i], i});
	}
	
	for(int i = 1; i <= n; i ++) if(s.count({p[i], i})) {
		queue <int> q; q.push(i);
		s.erase({p[i], i});
		
		auto add = [&](int l, int r) {
			auto it = s.lower_bound({l, -inf});
			while(it != s.end() && it -> first <= r) {
				q.push(it -> second);
				s.erase(it ++);
			}
		};
		
		while(!q.empty()) {
			int x = q.front(); q.pop();
			root[x] = i;
			add(p[x] + a, p[x] + b);
			add(p[x] - b, p[x] - a);
		}
	}
	
	for(int i = 1; i <= n; i ++)
		ans[root[i]] ++;
	for(int i = 1; i <= n; i ++)
		cout << ans[root[i]] << '\n';
}