//@formatter:off
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < int(n); ++i)
#define rrep(i,n) for (int i = int(n)-1; i >= 0; i--)
#define rep2(i,s,n) for (int i = int(s); i < int(n); ++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vd vector<double>
#define vvd vector<vector<double>>
#define vs vector<string>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define vp vector<P>
#define vvp vector<vector<P>>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using LP = pair<ll,ll>;
template<class S,class T> istream& operator>>(istream &is,pair<S,T> &p) { return is >> p.first >> p.second; }
template<class S,class T> ostream& operator<<(ostream &os,const pair<S,T> &p) { return os<<'{'<<p.first<<","<<p.second<<'}'; }
template<class T> istream& operator>>(istream &is,vector<T> &v) { for(T &t:v){is>>t;} return is; }
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) { os<<'[';rep(i,v.size())os<<v[i]<<(i==int(v.size()-1)?']':','); return os; }
void Yes(bool b) { cout << (b ? "Yes" : "No") << '\n'; }
void YES(bool b) { cout << (b ? "YES" : "NO") << '\n'; }
template<class T> bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}
template<class T> bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}
const int inf = 1001001001;
const ll linf = 1001001001001001001;
//@formatter:on

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n, A, B;
    cin >> n >> A >> B;
    vi x(n);
    cin >> x;
    int sz = 1;
    while (sz < n) sz *= 2;
    vvi G(sz * 2 - 1);
    rep(i, sz - 1) {
        G[i].pb(i * 2 + 1);
        G[i].pb(i * 2 + 2);
    }
    auto add = [&](auto &self, int from, int a, int b, int k = 0, int l = 0, int r = -1) -> void {
        if (r == -1) r = sz;
        if (r <= a or b <= l) return;
        if (a <= l and r <= b) {
            G[from].pb(k);
            return;
        }
        self(self, from, a, b, k * 2 + 1, l, (l + r) / 2);
        self(self, from, a, b, k * 2 + 2, (l + r) / 2, r);
    };
    rep(i, n) {
        {
            int l = lower_bound(all(x), x[i] + A) - x.begin();
            int r = upper_bound(all(x), x[i] + B) - x.begin();
            if (l < r) add(add, sz-1+i, l, r);
        }
        {
            int l = lower_bound(all(x), x[i] - B) - x.begin();
            int r = upper_bound(all(x), x[i] - A) - x.begin();
            if (l < r) add(add, sz-1+i, l, r);
        }
    }
    vi id(sz * 2 - 1, -1);
    auto bfs = [&](int i, int k) {
        int res = 0;
        id[i] = k;
        queue<int> q;
        q.push(i);
        while (q.size()) {
            int now = q.front();
            q.pop();
            if (now >= sz - 1 and now < sz - 1 + n) res++;
            for (int nx : G[now]) {
                if (id[nx] == -1) {
                    id[nx] = k;
                    q.push(nx);
                }
            }
        }
        return res;
    };
    int cnt = 0;
    vi num;
    rep2(i, sz - 1, sz - 1 + n) {
        if (id[i] == -1) {
            num.pb(bfs(i, cnt));
            cnt++;
        }
    }
    rep(i, n) {
        cout << num[id[sz - 1 + i]] << '\n';
    }
}