#include <bits/stdc++.h>
using namespace std;
using ari2 = array<int, 2>;
template <class T> using vt = vector<T>;
#define all(x) begin(x), end(x)
#define size(x) (int((x).size()))
#define REP(a,b,c,d) for(int a=(b);(d)>0?a<=(c):a>=(c);a+=(d))
#define FOR(a,b,c) REP(a,b,c,1)
#define ROF(a,b,c) REP(a,b,c,-1)

constexpr int mxN = 100005;
int N, K;

struct ST {
  int lz[mxN], st[mxN];
  #define lc i << 1
  #define rc lc | 1
  void push(const int i) {
    if (!lz[i])
      return;
    st[lc] += lz[i];
    st[rc] += lz[i];
    lz[lc] += lz[i];
    lz[rc] += lz[i];
    lz[i] = 0;
  }
  void radd(const int ql, const int qr, const int v, const int i = 1, const int tl = 0, const int tr = N-1) {
    if (tl > qr || tr < ql)
      return;
    if (ql <= tl && tr <= qr)
      st[i] += v, lz[i] += v;
    else {
      push(i);
      const int tm = tl + tr >> 1;
      radd(ql, qr, v, lc, tl, tm);
      radd(ql, qr, v, rc, tm+1, tr);
      st[i] = min(st[lc], st[rc]);
    }
  }
  int walk() {
    int tl = 0, tr = N-1, i = 1;
    while (tl < tr) {
      push(i);
      const int tm = tl + tr >> 1;
      if (!st[lc])
        tr = tm, i = lc;
      else
        tl = tm + 1, i = rc;
    }
    assert(st[i] == 0);
    return tl;
  }
  #undef lc
  #undef rc
} st;

struct BIT {
  vt<int> fen;
  BIT(const int n) : fen(n+5) {}
  void update(int i, const int v) {
    for (++i; i < size(fen); i += i & -i)
      fen[i] += v;
  }
  int query(int i) {
    int ret = 0;
    for (++i; i > 0; i -= i & -i)
      ret += fen[i];
    return ret;
  }
  int query(const int l, const int r) {
    return query(r) - query(l-1);
  }
};

signed main() {
#ifndef DEBUG
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
#endif
  cin >> N >> K;
  vt<int> A(N), ord(N);
  for (auto &i : A)
    cin >> i;
  iota(all(ord), 0);
  sort(all(ord), [&](const int &a, const int &b) {
    return A[a] < A[b];    
  });
  vt<int> pos(N), cmp(N);
  FOR(i, 0, N-1)
    pos[ord[i]] = i, cmp[i] = A[ord[i]];
  BIT fen(N);
  FOR(i, 0, N-1) {
    const int l = lower_bound(all(cmp), A[i]-K) - begin(cmp);
    const int r = upper_bound(all(cmp), A[i]+K) - begin(cmp) - 1;
    st.radd(pos[i], pos[i], i - fen.query(l, r));
    fen.update(pos[i], 1);
  }
  FOR(_, 1, N) {
    const int i = st.walk();
    cout << cmp[i] << '\n';
    const int l = lower_bound(all(cmp), cmp[i]-K) - begin(cmp);
    const int r = upper_bound(all(cmp), cmp[i]+K) - begin(cmp) - 1;
    st.radd(0, l-1, -1);
    st.radd(r+1, N-1, -1);
    st.radd(i, i, INT_MAX);
  }
}