#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
using namespace std;
#define N (1000000000+7)
#define M 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
 
const int inf = (int)1e9;

ll A(ll x){
    if(x>=0)return x;
    else return -x;
}
 
ll gcd(ll a, ll b) {
	if (b > a) {
		ll tmp = b;
		b = a;
		a = tmp;
	}
	if (a%b == 0)return b;
	else return gcd(b, a%b);
}
 
 
 map<int,int>mp;
 
 
 
int main(void){
	ll n,d;
	cin>>n>>d;
	vector<int>a(n),A(n);
	for(int i=0;i<n;i++){
		cin>>a[i];
		A[i]=a[i];
	}
	//cout<<a.end()-a.begin()<<endl;
	sort(A.begin(),A.end());
	for(int i=0;i<n;i++){
		ll index = upper_bound(A.begin(),A.end(),a[i]-d)-A.begin();
		cout<<index<<endl;
	}
    return 0;
}