//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 100010001;
const ll LINF = (ll)INF*INF*10;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}

const int N = 2e5 + 10;

//head

int n, a, b;
int x[N];
set<P> out;
int ans[N];

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> a >> b;
  rep(i, n) cin >> x[i];

  for(int i = 0; i < n; i++) out.emplace(x[i], i);
  out.emplace(INT_MAX, 56789);
  while(out.size() > 1) {
    int siz = out.size();
    queue<int> q;
    q.emplace(out.begin()->second);
    out.erase(out.begin());
    vi lis;
    while(!q.empty()) {
      int now = q.front();
      lis.emplace_back(now);
      q.pop();
      auto utr = out.upper_bound(P(x[now] + b+1, 0));
      int uu = utr->first;
      auto ltr = out.lower_bound(P(x[now] + a, 0));
      for(; ltr->first != uu;) {
        q.emplace(ltr->second);
        ltr = out.erase(ltr);
      }
      utr = out.upper_bound(P(x[now] - a+1, 0));
      uu = utr->first;
      ltr = out.lower_bound(P(x[now] - b, 0));
      for(; ltr->first != uu;) {
        q.emplace(ltr->second);
        ltr = out.erase(ltr);
      }
    }
    rep(i, lis.size()) {
      ans[lis[i]] = siz - out.size();
    }
  }

  rep(i, n) {
    cout << ans[i] << '\n';
  }
}