#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;

int main(){
    int n;
    ll d;
    cin >> n >> d;
    vector<ll> a(n);
    rep(i,n) cin >> a[i];
    vector<pll> p(n);
    rep(i,n) p[i] = pll(a[i],i);
    sort(p.begin(),p.end());
    vector<int> ans(n);
    rep(i,n){
        ll k = p[i].first;
        int l = -1,r = n;
        while(r - l > 1){
            int m = (l+r)/2;
            if(k-p[m].first>=d) l = m;
            else r = m;
        }
        ans[p[i].second] = r;
    }
    rep(i,n) cout << ans[i] << endl;
    return 0;
}