#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll big=1e18;
const double PI=2*asin(1);

int main() {
  int N, D;
  cin>>N>>D;
  vector<int> arr(N);
  int A[N];
  for(int i=0;i<N;++i){
    cin>>A[i];
    arr[i] = A[i];
  }
  sort(arr.begin(), arr.end());
  map<int, int> amap;
  int index;
  for(int i=0;i<N;++i){
    index = upper_bound(arr.begin(), arr.end(), A[i]-D)-arr.begin();
    amap[A[i]] = index;
  }
  for(int i=0;i<N;++i){
    cout<<amap[A[i]]<<endl;
  }
}