#include<cstdio>
#include<algorithm>
struct Element{
    int v; int id;
    bool operator < (const Element &other)const{
        return v<other.v;
    }
};
Element a[200005];
int ans[200005];

int main(){
    int n,d;
    scanf("%d%d",&n,&d);
    for(int i = 1; i <= n; i++){
        scanf("%d",&a[i].v);
        a[i].id = i;
    }
    std::sort(a+1,a+1+n);
    int p = n;
    for(int i = n; i >= 1; i--){
        while(p>=1 && a[p].v>a[i].v-d) p--;
        ans[a[i].id] = p;
    }
    for(int i = 1; i <= n; i++) printf("%d\n",ans[i]);
    return 0;
}