#include <bits/stdc++.h>

using namespace std;


using int64 = long long;
const int mod = (1e9 + 7);

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

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 T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

struct UnionFind {
  vector< int > data;

  UnionFind(int sz) {
    data.assign(sz, -1);
  }

  bool unite(int x, int y) {
    x = find(x), y = find(y);
    if(x == y) return (false);
    if(data[x] > data[y]) swap(x, y);
    data[x] += data[y];
    data[y] = x;
    return (true);
  }

  int find(int k) {
    if(data[k] < 0) return (k);
    return (data[k] = find(data[k]));
  }

  int size(int k) {
    return (-data[find(k)]);
  }
};


int main() {
  int N, A, B;
  cin >> N >> A >> B;
  vector< int > X(N);
  cin >> X;


  UnionFind uf(N);

  {
    int x = 0, y = 0;
    set< int > nxt;
    for(int i = 0; i < N; i++) {
      nxt.emplace(i);
    }
    for(int i = 0; i < N; i++) {
      while(x < N && X[x] - X[i] < A) {
        ++x;
      }
      while(y < N && X[y] - X[i] <= B) {
        ++y;
      }
      auto it = nxt.lower_bound(x);
      while(it != end(nxt) && *it < y) {
        uf.unite(i, *it);
        it = nxt.erase(it);
      }
    }
  }

  {
    int x = N - 1, y = N - 1;
    set< int > nxt;
    for(int i = 0; i < N; i++) {
      nxt.emplace(i);
    }
    for(int i = N - 1; i >= 0; i--) {
      while(x >= 0 && X[i] - X[x] < A) {
        --x;
      }
      while(y >= 0 && X[i] - X[y] <= B) {
        --y;
      }
      for(;;) {
        auto it = nxt.upper_bound(y);
        if(it == end(nxt)) break;
        if(*it <= x) {
          uf.unite(*it, i);
          nxt.erase(it);
        } else {
          break;
        }
      }

    }
  }


  for(int i = 0; i < N; i++) {
    cout << uf.size(i) << "\n";
  }
}