#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;

#define REP(i, init, n) for(int i = (int)(init); i < (int)(n); i++)
#define All(A) A.begin(), A.end()
#define rAll(A) A.rbegin(), A.rend()

#define vi vector<int>
#define vl vector<long>
#define vvi vector<vector<int>>
#define vvl vector<vector<long>>
#define pint pair<int, int>
#define plong pair<long, long>

int N, A, B;
vi X;

void solve() {
    dsu C(N);
    int range_min = 0;
    int j = lower_bound(X.begin(), X.end(), X[0] + A) - X.begin();
    REP(i, 0, N) {
        // cout << i << " " << j << endl;
        int range_min = lower_bound(X.begin(), X.end(), X[i] + A) - X.begin();
        j = max(j - 1, range_min);
        auto itr = upper_bound(X.begin(), X.end(), X[i] + B);
        // cout << itr - X.begin() << endl;
        while(j < itr - X.begin()) {
            C.merge(i, j);
            j++;
        }
    }
    REP(i, 0, N) {
        cout << C.size(i) << endl;
    }
}

int main() {
    cin >> N >> A >> B;
    X.resize(N);
    REP(i, 0, N) {
        cin >> X[i];
    }
    solve();
}