#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FOREACH(x, a) for (auto&(x) : (a))
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) ll(x.size())

int main() {
  ll n, d;
  cin >> n >> d;
  vector<ll> a(n);
  REP(i, n) { cin >> a[i]; }
  vector<ll> ord(n);
  iota(ALL(ord), 0);
  sort(ALL(ord), [&](ll i, ll j) { return a[i] < a[j]; });
  vector<ll> ans(n, 0);

  REP(i, n) {
    ll ok = -1, ng = n;
    while (ok + 1 < ng) {
      ll m = (ok + ng) / 2;
      (a[i] - a[ord[m]] >= d ? ok : ng) = m;
    }
    ans[i] = ok + 1;
  }

  REP(i, n) { cout << ans[i] << "\n"; }
}