#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll int
bool find(vector<int> b){
    for(int i=0;i<b.size();i++){
        b[i]=b[i]%12;
    }
    sort(b.begin(),b.end());
    vector<int> aa={0,2,4,5,7,9,11};
   
    for(int i=0;i<b.size();i++){
        for(int j=0;j<aa.size();j++)
        if(b[i]==aa[j]) return true;
    }
    return false;
    
}
int main() {
   ll n,d;
   cin>>n>>d;
   vector<int> A(n);
   for(ll i=0;i<n;i++) cin>>A[i];
    vector<int> aa = A;
    sort(A.begin(),A.end());

    map<int, int> mp;
    for (auto a : A) mp[a] =  upper_bound(A.begin(),A.end(), a - d) - A.begin();
    for (auto a : aa)
    {
        cout << mp[a] << '\n';
    }
   
}