#include <bits/stdc++.h>
#include <math.h>

#include <algorithm>
#include <array>
#include <atcoder/all>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <vector>

using namespace std;
using namespace atcoder;

using Graph = vector<vector<int>>;

using ll = long long;
typedef pair<ll, ll> P_ll;
typedef pair<int, int> P;

const ll INF_ll = 1e17;
const int INF = 1e8;
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;
}
template <typename T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;

int main() {
  ll N, A, B;
  cin >> N >> A >> B;
  vector<ll> x(N);
  vector<pair<ll, P_ll>> y;
  for (int i = 0; i < N; i++) {
    cin >> x[i];
    y.push_back({x[i], {1, i}});
    y.push_back({x[i] + A, {0, i}});
  }
  dsu tree(N);
  sort(y.begin(), y.end());
  min_priority_queue<P_ll> pq;
  for (int i = 0; i < y.size(); i++) {
    auto p = y[i];
    // cout << p.first << " " << p.second.first << " " << p.second.second <<
    // endl;
    if (p.second.first == 1) {
      P_ll max_r = {-1, -1};
      while (!pq.empty()) {
        auto pp = pq.top();
        pq.pop();
        if (pp.first >= p.first) {
          tree.merge(p.second.second, pp.second);
          chmax(max_r, pp);
        }
      }
      if (max_r.first > 0) {
        pq.push(max_r);
      }
    } else {
      pq.push({x[p.second.second] + B, p.second.second});
    }
  }
  for (int i = 0; i < N; i++) {
    cout << tree.size(i) << endl;
  }

  return 0;
}