#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int main() {
    int n, d;
    cin >> n >> d;
    int a[n];
    int b[n];
    rep(i,n){
        cin >> a[i];
        b[i] = a[i];
    }
    sort(b,b+n);

    rep(i,n){
        int ans = lower_bound(b,b+n,a[i]-d+1) - b;
        cout << ans << endl;
    }
    
    return 0;
}