#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
  int n,d;cin>>n>>d;
  vector<pair<int,int>> A(n);
  for(int i = 0; n > i; i++){
    cin>>A[i].first;
    A[i].second = i;
  }
  sort(A.begin(),A.end());
  int nw = 0;
  vector<pair<int,int>> B(n);
  for(int i = 0; n > i; i++){
    while(A[i].first-A[nw].first >= d){
      nw++;
    }
    B[i] = {A[i].second,nw};
  }
  sort(B.begin(),B.end());
  for(int i = 0; n > i; i++){
    cout << B[i].second << endl;
  }
}