#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }

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

  int n, d;
  cin >> n >> d;
  vector<int> org(n), a(n);
  rep(i, 0, n) {
    cin >> a[i];
    org[i] = a[i];
  }
  sort(a.begin(), a.end());

  map<int, int> mp;
  rep(i, 0, n) {
    int key = a[i] - d;
    int x = 0;
    if (key > 0)
      x = upper_bound(a.begin(), a.end(), key) - a.begin();

    mp[a[i]] = x;
  }

  rep(i, 0, n) cout << mp[org[i]] << endl;
}