#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;

class UnionFind {
public:
    vector<int> uni;
    UnionFind(int s) : uni(s, -1) {}
    int root(int a) {
        return uni[a] < 0 ? a : uni[a] = root(uni[a]);
    }
    bool connect(int a, int b) {
        a = root(a);
        b = root(b);
        if(a == b) return false;
        if(uni[a] > uni[b]) swap(a, b);
        uni[a] = uni[a] + uni[b];
        uni[b] = a;
        return true;
    }
    bool isConnect(int a, int b) {
        return root(a) == root(b);
    }
    int size(int a) {
        return -uni[root(a)];
    }
};

int main() {
    int N, A, B;
    cin >> N >> A >> B;
    vector<int> X(N);
    for(auto &e : X) cin >> e;
    UnionFind uf(N);
    vector<int> cum(N + 1);
    rep(i, N) {
        int l = lower_bound(X.begin(), X.end(), X[i] + A) - X.begin();
        int r = upper_bound(X.begin(), X.end(), X[i] + B) - X.begin() - 1;
        if(l > r) continue;
        uf.connect(i, l);
        cum[l]++, cum[r]--;
    }
    rep(i, N) cum[i + 1] += cum[i];
    rep(i, N) if(cum[i]) uf.connect(i, i + 1);
    rep(i, N) cout << uf.size(i) << '\n';
    return 0;
}