#include<bits/stdc++.h>
// #include<atcoder/all>
using namespace std;
// using namespace atcoder;
using lint = long long;
using graph = vector<vector<int>>;
#define endl '\n'
lint const mod = 1e9+7;
//long const mod = 998244353;
struct UnionFind {
    vector<int> par;
    
    UnionFind(int n) : par(n, -1) { }
    void init(int n) { par.assign(n, -1); }
    
    int find(int x) {
        if (par[x] < 0) return x;
        else return par[x] = find(par[x]);
    }
    
    bool same(int x, int y) {
        return find(x) == find(y);
    }
    
    bool unite(int x, int y) {
        x = find(x); y = find(y);
        if (x == y) return false;
        if (par[x] > par[y]) swap(x, y); // merge technique
        par[x] += par[y];
        par[y] = x;
        return true;
    }
    
    int size(int x) {
        return -par[find(x)];
    }
};

int main(){
    lint n,a,b;
    cin >> n >> a >> b;
    vector<lint>x(n);
    for(int i=0;i<n;i++)cin >> x[i];
    graph g(n);
    vector<int>tmp(n+1);
    UnionFind unif(n);
    for(int i=0;i<n;i++){
        auto lItr = lower_bound(x.begin(), x.end(), x[i]+a);
        auto rItr = upper_bound(x.begin(), x.end(), x[i] +b);
        int l = lItr - x.begin();
        int r = rItr - x.begin();
        
        if(l < r){
            unif.unite(i,l);
            tmp[l]++;
        tmp[r-1]--;
        }
        // cout << i<<" " << l << " " << r << endl;
    }
    for(int i=1;i<n;i++){
        tmp[i] += tmp[i-1];
    }
    // for(int i=0;i<n;i++)cout << tmp[i]<<" ";
    cout << endl;

    for(int i=1;i<n;i++){
        if(tmp[i] > 0 && tmp[i-1] > 0){
            unif.unite(i,i-1);
        }
    }

    for(int i=0;i<n;i++){
        cout << unif.size(i)<<endl;
    }

}