#include <bits/stdc++.h>
using namespace std;

#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#define LOG(x) if(DEBUG)cout<<TO_STRING(x)<<"="<<x<<" ";
#define LOGE if(DEBUG)cout<<endl;

template<class T>bool chmax(T & a, const T & b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }

int main(){

	lli n,d;
	cin>>n>>d;

	vector<lli> a(n),b(n);

	REP(i,0,n){
		cin>>a[i];
		b[i] = a[i];
	}

	sort(b.begin(),b.end());

	REP(i,0,n){
		lli cnt = (lli)(lower_bound(b.begin(),b.end(),a[i]-d+1)-b.begin());
		cout<<cnt<<endl;
	}


    return 0;
}