#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>

using namespace std;

struct unionfind {
    vector<long long> par,_size,_right,_left;
    unionfind(long n) : par(n+1), _size(n+1,1), _right(n+1), _left(n+1) {
        iota(par.begin(), par.end(), 0);
        iota(_right.begin(), _right.end(), 0);
        iota(_left.begin(), _left.end(), 0);
    }
    void init(long long n) {
        par = vector<long long>(n);
        _size = vector<long long>(n);
        for(long long i=0; i<n; i++) par[i]=i;
    }
    long long root(long long x) {
        if (par[x] == x) return x;
        return par[x] = root(par[x]);
    }
    long long right(long long x) {return _right[root(x)];}
    long long left(long long x) {return _left[root(x)];}
    bool merge(long long x, long long y) {
        x = root(x);
        y = root(y);
        if (x==y) return false;
        if(_size[x]<_size[y]) swap(x,y);
        _left[x] = min(_left[x], _left[y]);
        _right[x] = max(_right[x], _right[y]);
        _size[x] += _size[y];
        par[y] = x;
        return true;
    }
    void merge_range(long long x, long long y) {
        if (x > y) return;
        while(right(x) < y) this->merge(right(x), right(x)+1);
    }
    bool issame(long long x, long long y) { return root(x) == root(y); }
    long long size(long long x) { return _size[root(x)]; }
};

int main() {
    int n,a,b;
    cin >> n >> a >> b;
    vector x(n,0);
    for (int i=0; i<n; i++) cin >> x[i];
    unionfind uni(n);

    vector imos(n+1, 0);
    for (int i=0; i<n-1; i++) {
        auto l = lower_bound(x.begin(), x.end(), x[i]+a);
        auto r = upper_bound(x.begin(), x.end(), x[i]+b);
        if (l >= r) continue;
        int lindex = l - x.begin();
        int rindex = r - x.begin();
        uni.merge(i, lindex);
        uni.merge_range(lindex, rindex-1);
        cerr<<i<<endl;
    }

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