#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;

int main(){
    int n,d;
    cin>>n>>d;
    vector<P>p(n);
    vector<int>a(n),ans(n);
    rep(i,n){
        cin>>a[i];
        p[i]=P(a[i],i);
    }
    sort(a.begin(),a.end());
    sort(p.begin(),p.end());
    rep(i,n){
        ans[p[i].second]=(lower_bound(a.begin(),a.end(),p[i].first-d+1)-a.begin());
    }
    rep(i,n)cout<<ans[i]<<endl;
}