#define CPP17
#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#ifdef CPP17
#include <variant>
#endif

#define endl codeforces

#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)

using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
using size_type = ssize_t;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }

template <typename T, std::size_t Head, std::size_t... Tail> 
struct multi_dim_array { using type = std::array<typename multi_dim_array<T, Tail...>::type, Head>; };

template <typename T, std::size_t Head> 
struct multi_dim_array<T, Head> { using type = std::array<T, Head>; };

template <typename T, std::size_t... Args> using mdarray = typename multi_dim_array<T, Args...>::type;

#ifdef CPP17
template <typename T, typename F, typename... Args> 
void fill_seq(T &t, F f, Args... args) { 
    if constexpr (std::is_invocable<F, Args...>::value) { 
        t = f(args...); 
    } else { 
        for (size_type i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i); 
    } 
}
#endif

template <typename T> vec<T> make_v(size_type sz) { return vec<T>(sz); }

template <typename T, typename... Tail> 
auto make_v(size_type hs, Tail&&... ts) { 
    auto v = std::move(make_v<T>(std::forward<Tail>(ts)...)); 
    return vec<decltype(v)>(hs, v); 
}

namespace init__ { 
struct InitIO { 
    InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } 
} init_io; 
}
#define CPP17


namespace tree {

struct UnionFind {
    vec<ll> rank, par;
    vec<ssize_t> sz;

    UnionFind(ll n) : rank(n), par(n), sz(n) {
        init();
    }

    void init() {
        std::fill(ALL(rank), 1);
        std::iota(ALL(par), 0);
        std::fill(ALL(sz), 1);
    }

    ll find(ll n) {
        return (n == par[n] ? n : par[n] = find(par[n]));
    }

    bool unit(ll x, ll y) {
        ll px = find(x), py = find(y);
        if (px == py) return false;
        if (rank[px] < rank[py]) std::swap(px, py);
        par[py] = px;
        rank[px] += (rank[px] == rank[py]);
        sz[px] += sz[py];
        return true;
    }

    bool same(ll x, ll y) {
        return find(x) == find(y);
    }

    ssize_t size(ll n) {
        return sz[find(n)];
    }
};

}

ll ceil_pow2(ll a) {
    ll ret = 1;
    while (ret < a) ret *= 2;
    return ret;
}

struct Solver {
    ll n, a, b, sz;
    vec<ll> xv;
    tree::UnionFind uf;
    vec<bool> used;

    Solver(ll n, ll a, ll b) 
        : n(n), a(a), b(b), sz(ceil_pow2(n)), xv(n), uf(2 * sz), used(2 * sz) 
    {
        for (ll &e : xv) std::cin >> e;
    }

    void add_edge(ll src, ll dst, ll l, ll r, ll ql, ll qr) {
        if (ql <= l && r <= qr) {
            uf.unit(src, dst);
            used[src] = true;
            return;
        } else if (r <= ql || qr <= l) {
            return;
        }

        ll m = (l + r) / 2;
        add_edge(src, 2 * dst + 0, l, m, ql, qr);
        add_edge(src, 2 * dst + 1, m, r, ql, qr);
    }

    void add_edge(ll src, ll ql, ll qr) {
        add_edge(src, 1, 0, sz, ql, qr);
    }

    void add_edge_init(ll idx, ll l, ll r) {
        if (r - l == 1) return;
        if (used[idx]) {
            for (ll i = l; i < std::min(r, n); i++) uf.unit(idx, i + sz);
        }
        ll m = (l + r) / 2;
        add_edge_init(2 * idx + 0, l, m);
        add_edge_init(2 * idx + 1, m, r);
    }

    vec<ll> solve() {
        for (ll i = 0; i < n; i++) {
            ll e = xv[i];
            auto l = std::distance(xv.begin(), std::lower_bound(ALL(xv), e + a));
            auto r = std::distance(xv.begin(), std::upper_bound(ALL(xv), e + b));
            if (l == r) continue;
            add_edge(i + sz, l, r);
        }

        vec<ll> dec(2 * sz);
        for (ll i = 0; i < sz; i++) dec[uf.find(i)]++;
        
        add_edge_init(0, 0, n);
        
        vec<ll> ret(n);
        for (ll i = 0; i < n; i++) {
            ll p = uf.find(i + sz);
            ll e = uf.size(i + sz);
            ret[i] = e - dec[p];
        }
        return ret;
    }
};

int main() {
    ll n, a, b;
    std::cin >> n >> a >> b;
    Solver solver(n, a, b);
    auto ans = solver.solve();
    for (ll e : ans) std::cout << e << "\n";
    return 0;
}