#include <bits/stdc++.h>

using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i,n) for (int i = (int)(n-1); i >= 0; --i)
#define Rep(i,a,b) for (int i = a; i < b; ++i)
#define rRep(i,a,b) for (int i = a; i > b; --i)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define Bit(x,i) (((x)>>(i))&1)
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const double PI = acos(-1);
const int INF = 1e9+2;
const ll LINF = 3e18;

struct UnionFind {
  vector<int> par;
  UnionFind() { }
  UnionFind(int n) : par(n, -1) { }
  void init(int n) { par.assign(n, -1); }
  int root(int x) {
    if (par[x] < 0) return x;
    else return par[x] = root(par[x]);
  }
  bool issame(int x, int y) {
    return root(x) == root(y);
  }
  bool merge(int x, int y) {
    x = root(x); y = root(y);
    if (x == y) return false;
    if (par[x] > par[y]) swap(x, y);
    par[x] += par[y];
    par[y] = x;
    return true;
  }
  int size(int x) {
    return -par[root(x)];
  }
};

vll X;
UnionFind uf(200100);

int main() {
  ll N, A, B; cin >> N >> A >> B;
  rep(i, N) {
    ll x; cin >> x;
    X.push_back(x);
  }
  rep(i, N) {
    int ldx = lower_bound(all(X), X[i]+A) - X.begin();
    int rdx = lower_bound(all(X), X[i]+B+1) - X.begin() - 1;
    if(ldx > rdx) continue;
    uf.merge(i, ldx);
    uf.merge(i, rdx);
    while(ldx < rdx) {
      if(uf.issame(ldx, ldx+1)) break;
      uf.merge(ldx, ldx+1);
      ldx++;
    }
    while(ldx < rdx) {
      if(uf.issame(rdx-1, rdx)) break;
      uf.merge(rdx-1, rdx);
      rdx--;
    }
  }
  rep(i, N) {
    cout << uf.size(i) << endl;
  }
}