#include <bits/stdc++.h>
using namespace std;
int main(){
  int N, D;
  cin >> N >> D;
  vector<int> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  vector<pair<int, int>> B(N);
  for (int i = 0; i < N; i++){
    B[i] = make_pair(A[i], i);
  }
  sort(B.begin(), B.end());
  vector<int> ans(N);
  for (int i = 0; i < N; i++){
    ans[B[i].second] = lower_bound(B.begin(), B.end(), make_pair(B[i].first - D + 1, 0)) - B.begin();
  }
  for (int i = 0; i < N; i++){
    cout << ans[i] << endl;
  }
}