#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

const long long INF = 1e18;
struct UnionFind {
    vector<int> par;
    vector<int> rank;
    vector<ll> Size;
    UnionFind(int n = 1) {
        init(n);
    }

    void init(int n = 1) {
        par.resize(n + 1); rank.resize(n + 1); Size.resize(n + 1);
        for (int i = 0; i <= n; ++i) par[i] = i, rank[i] = 0, Size[i] = 1;
    }

    int root(int x) {
        if (par[x] == x) {
            return x;
        }
        else {
            int r = root(par[x]);
            return par[x] = r;
        }
    }

    bool issame(int x, int y) {
        return root(x) == root(y);
    }

    bool merge(int x, int y) {
        x = root(x); y = root(y);
        if (x == y) return false;
        if (rank[x] < rank[y]) swap(x, y);
        if (rank[x] == rank[y]) ++rank[x];
        par[y] = x;
        Size[x] += Size[y];
        return true;
    }

    ll size(int x){
        return Size[root(x)];
    }
};
ll N, A, B;
vector<ll> x;

//const ll mod = 1000000007;
ll imos[201000];
void f(ll L, ll R) {
    auto itr = lower_bound(x.begin(), x.end(), L);
    auto itr2 = lower_bound(x.begin(), x.end(), R+1);
    if(itr2 == itr) return;
    itr2--;
    int idx = itr - x.begin();
    int idx2 = itr2 - x.begin();
    imos[idx]++;
    imos[idx2]--;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> N >> A >> B;
    x.resize(N);
    for(int i = 0; i < N; i++) cin >> x[i];
    UnionFind uni(N);
    for(int i = 0; i < N; i++) {
        auto itr = lower_bound(x.begin(), x.end(), x[i] - B);
        if(*itr <= x[i] - A) {
            int idx = itr - x.begin();
            uni.merge(idx, i);
            f(x[i]-B, x[i]-A);
        }
        itr = lower_bound(x.begin(), x.end(), x[i] + A);
        if(itr != x.end() and *itr <= x[i] + B) {
            int idx = itr - x.begin();
            uni.merge(idx, i);
            f(x[i]+A, x[i]+B);
        }
    }
    for(int i = 0; i < N; i++) {
        imos[i+1] += imos[i];
        if(imos[i] > 0 and i + 1 < N) {
            uni.merge(i, i + 1);
        }
    }
    for(int i = 0; i < N; i++) {
        cout << uni.size(i) << endl;
    }
    return 0;
}