#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;

// UnionFind
struct UnionFind {
    vector<ll> par;
    vector<ll> siz;

    UnionFind(ll N) : par(N), siz(N, 1LL) {
        for(int i = 0; i < N; i++)
            par[i] = i;
    }
    int root(int x) {
        if(par[x] == x)
            return x;
        return par[x] = root(par[x]);
    }
    void unite(int x, int y) {
        int rx = root(x);
        int ry = root(y);
        if(rx == ry)
            return;
        if(siz[rx] < siz[ry])
            swap(rx, ry);
        siz[rx] += siz[ry];
        par[ry] = rx;
    }
    bool same(int x, int y) {
        int rx = root(x);
        int ry = root(y);
        return rx == ry;
    }
    ll size(ll x) { return siz[root(x)]; }
};

int main() {
    int N, A, B;
    cin >> N >> A >> B;
    vector<ll> X(N);
    rep(i, N) cin >> X[i];
    vector<ll> imos(N + 1);
    vector<ll> im(N + 1);
    UnionFind uf(N);
    rep(i, N) {
        auto lit = lower_bound(All(X), X[i] + A);
        auto rit = lower_bound(All(X), X[i] + B + 1);
        if(lit == X.end() || lit == rit)
            continue;
        rit--;
        int l = lit - X.begin(), r = rit - X.begin();
        im[l]++;
        im[r]--;
        uf.unite(i, l);
        uf.unite(i, r);
    }
    rep(i, N) { imos[i + 1] = im[i] + imos[i]; }
    FOR(i, 1, N) {
        if(imos[i])
            uf.unite(i, i - 1);
    }
    rep(i, N) { cout << uf.size(i) << endl; }
    return 0;
}