#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
// constexpr int mod = 1000000007;
constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

struct UnionFind{
    int sz;
    vector<int> par;
    vector<int> rank;

    UnionFind(int n) : sz(n) {
        par.resize(sz);
        rank.assign(sz, 0);
        for(int i = 0; i < sz; ++i){
            par[i] = i;
        }
    }

    int find(int x){
        if(par[x] == x) 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(rank[x] < rank[y])   par[x] = y;
        else{
            par[y] = x;
            if(rank[x] == rank[y])  ++rank[x];
        }
        return true;
    }
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

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

    int V = 1;
    while(V * 2 < n)    V <<= 1;
    V <<= 1;
    vector<vector<int>> g(V * 2);
    for(int k = 1; k < V; ++k){
        int chl = k << 1, chr = k << 1 | 1;
        g[k].emplace_back(chl);
        g[chl].emplace_back(k);
        g[k].emplace_back(chr);
        g[chr].emplace_back(k);
    }
    
    for(int i = 0; i < n - 1; ++i){
        int l = lower_bound(begin(x), end(x), x[i] + a) - begin(x);
        int r = upper_bound(begin(x), end(x), x[i] + b) - begin(x);
        if(r - l <= 0)  continue;
        vector<int> node(1, V + i);
        for(l += V, r += V; l < r; l >>= 1, r >>= 1){
            if(l & 1)   node.emplace_back(l++);
            if(r & 1)   node.emplace_back(--r);
        }
        g.emplace_back(node);
    }

    int N = g.size();
    UnionFind uf(N);
    vector<bool> used(N);
    for(int v = V * 2; v < N; ++v){
        for(int u : g[v]){
            used[u] = true;
            uf.unite(v, u);
        }
    }
    
    auto dfs = [&](auto&& self, int k, int l, int r, bool f = false) -> void {
        if(k >= V)  return;
        f |= used[k];
        if(f){
            uf.unite(k, k << 1);
            uf.unite(k, k << 1 | 1);
        }
        self(self, k << 1, l, (l + r) >> 2, f);
        self(self, k << 1 | 1, (l + r) >> 2, f);
    };
    dfs(dfs, 1, 0, V * 2);

    map<int, int> mp;
    for(int i = 0; i < n; ++i){
        int v = V + i;
        mp[uf.find(v)] += 1;
    }

    for(int i = 0; i < n; ++i){
        int v = V + i;
        cout << mp[uf.find(v)] << '\n';
    }

    return 0;
}