#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
#define debug(x) std::cout << #x << ": " << x << '\n';
const int N = 2e5+7;
int par[N], cnt[N];
int root(int u) {
    if (par[u] == u)
        return u;
    else
        return par[u] = root(par[u]);
}   
void merge(int u, int v) {
    u = root(u);
    v = root(v);
    if (u == v)
        return;
    if (cnt[v] < cnt[u])
        swap(u, v);
    par[u] = v;
    cnt[v] += cnt[u];
}   
signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    int n, l, r;
    cin >> n >> l >> r;
    vector <int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }   
    for (int i = 0; i < n; ++i) {
        par[i] = i;
        cnt[i] = 1;
    }
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < i; ++j) {
            if (a[j] >= a[i] - r && a[j] <= a[i] - l) {
                merge(i, j);
            }
        }   
    }   
    for (int i = 0; i < n; ++i)
        cout << cnt[root(i)] << ' ';
    cout << endl;
}