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

class union_find {
  public:
    union_find(int n) : data(n, -1) {}
    int unite(int x, int y) {
        x = root(x), y = root(y);
        if(x != y) {
            if(size(x) < size(y)) swap(x, y);
            data[x] += data[y];
            return data[y] = x;
        }
        return -1;
    }
    int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
    int size(int x) { return -data[root(x)]; }
    bool same(int x, int y) { return root(x) == root(y); }

  private:
    vector<int> data;
};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int N,A,B; cin >> N >> A >> B;
    vector<int> x(N);
    rep(i,N) cin >> x[i];

    union_find uf(N);
    vector<pair<int,int>> imos(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();
        if(L < R) {
            imos[L].first++;
            imos[R].second++;
            uf.unite(i, L);
        }
    }

    int cnt = 0;
    rep(i,N) {
        cnt -= imos[i].second;
        if(cnt) uf.unite(i - 1, i);
        cnt += imos[i].first;
    }
    rep(i,N) cout << uf.size(i) << "\n";
}