#include <bits/stdc++.h>

using namespace std;

class union_find {
  int n;
  int cnt;           // number of connected components
  vector<int> par;
  vector<int> rank;
  vector<int> sz;    // size of each component
public:
  union_find(int n) : n(n), cnt(n), par(n), rank(n), sz(n) {
    for (int i = 0; i < n; i++) {
      par[i] = i;
      sz[i] = 1;
    }
  }
  
  int find(int x) {
    return par[x] == x ? x : par[x] = find(par[x]);
  }
  
  void unite(int x, int y) {
    x = find(x);
    y = find(y);
    if (x == y) return;
    
    --cnt;
    if (rank[x] < rank[y]) {
      par[x] = y;
      sz[y] += sz[x];
    } else {
      par[y] = x;
      sz[x] += sz[y];
      if (rank[x] == rank[y])
        ++rank[x];
    }
    
  }
  
  bool same(int x, int y) {
    return find(x) == find(y);
  }
  
  int compCnt() {
    return cnt;
  }
  
  int size(int x) {
    return sz[find(x)];
  }
};

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n, a, b;
  cin >> n >> a >> b;

  vector<int> x(n);
  for (int i = 0; i < n; i++)
    cin >> x[i];


  union_find tree(n);
  int l = 0, r = 0;
  vector<int> sum(n);
  for (int i = 0; i < n; i++) {
    while (l < n && x[i] + a > x[l]) ++l;
    while (r < n && x[i] + b >= x[r]) ++r;
    if (l < r) {
      tree.unite(i, l);
      sum[l]++;
      sum[r-1]--;
    }
  }

  int acc = 0;
  for (int i = 0; i < n; i++) {
    acc += sum[i];
    if (acc > 0)
      tree.unite(i, i+1);
  }

  for (int i = 0; i < n; i++)
    cout << tree.size(i) << endl;
  
  return 0;
}