import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int root(int[] uf, int u) {
  return (uf[u] < 0) ? u : (uf[u] = uf.root(uf[u]));
}
bool connect(int[] uf, int u, int v) {
  u = uf.root(u);
  v = uf.root(v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const A = readLong();
      const B = readLong();
      auto X = new long[N];
      foreach (u; 0 .. N) {
        X[u] = readLong();
      }
      
      auto uf = new int[N];
      uf[] = -1;
      
      auto fs = new int[N];
      
      void ae(int u, int a, int b) {
        if (a < b) {
          debug {
            writefln("ae %s [%s, %s)", u, a, b);
          }
          uf.connect(u, a);
          ++fs[a];
          --fs[b - 1];
        }
      }
      
      foreach (u; 0 .. N) {
        ae(u, X.lowerBound(X[u] - B), X.upperBound(X[u] - A));
        ae(u, X.lowerBound(X[u] + A), X.upperBound(X[u] + B));
      }
      foreach (u; 0 .. N - 1) {
        fs[u + 1] += fs[u];
      }
      foreach (u; 0 .. N - 1) {
        if (fs[u] > 0) {
          uf.connect(u, u + 1);
        }
      }
      
      foreach (u; 0 .. N) {
        writeln(-uf[uf.root(u)]);
      }
    }
  } catch (EOFException e) {
  }
}