#include <iostream>

#include <cstdio>

#include <cstring>

#include <algorithm>

#include <queue>

#include <stack>

#include <string>

#include <map>

#include <cmath>

using namespace std;

typedef long long LL;

#define inf 1e9

#define rep(i,j,k) for(int i = (j); i <= (k); ++i)

#define rep__(i,j,k) for(int i = (j); i < (k); ++i)

#define per(i,j,k) for(int i = (j); i >= (k); --i)

#define per__(i,j,k) for(int i = (j); i > (k); --i) 

const int N = (int)5e5 + ;

int arr[N];

int ans[N];

struct node{

    int index;

    int w;

    void set(int x,int y){

        index = x;

        w = y;

    }

}que[N];

int main(){

    int n,m;

    scanf("%d%d",&n,&m);

    rep(i,,n) scanf("%d",arr+i);

    int l,r,mid,A;

    int len = ;

    //最后一个先处理

    que[++len].set(n,arr[n]);

    ans[n] = -;

    //

    per(i,n-,){

        //比之前的都大

        if(arr[i] + m > que[len].w){

            ans[i] = -;

            if(arr[i] > que[len].w)

                que[++len].set(i,arr[i]);

        }

        //比第一个还小

        else if(arr[i] + m <= que[].w){

            ans[i] = que[].index - i -;

            // printf("this is %d test  ans is %d \n",i,ans[i]);

        }

        //在中间有答案

        else{

            l = ;

            r = len;

            while(l <= r){

                mid = (l + r) >> ;

                if(arr[i] + m <= que[mid].w){

                    A = que[mid].index;

                    r = mid - ;

                }

                else l = mid + ;

            }

  //          printf("arr[%d] = index %d - index %d - 1\n",i,A,i);

            ans[i] = A - i -;

        }

    }

    // rep(i,1,ll) printf("%d ",que[i].index);

    // printf("\n");

    printf("%d",ans[]);

    rep(i,,n) printf(" %d",ans[i]);

    printf("\n");

    getchar(); getchar();

    return ;

}