#include <bits/stdc++.h>

#define rep(X,N) for(ll X = 0LL; X < (N); X++)
#define ALL(V) (V).begin(),(V).end()
#define endl "\n"

using namespace std;
typedef long long ll;

const double PI = 3.1415926535897932384626;
const ll MODN = 1000000007;
const ll MODN2 = 998244353;
const double EPS = 1e-10;

//ソート済み配列に対して、指定した数以下の個数を返す関数
template<typename T>
inline int less_or_eq_count(std::vector<T> v, T x, int size){
    
    int ok = -1;
    int ng = size;

    while(ng - ok > 1){
        int tmp = (ok + ng) / 2;

        if(v[tmp] <= x){
            ok = tmp;
        }else ng = tmp;
    }

    return ok + 1;
}

//最大値 ULONG_MAX
inline uint32_t xor128(void) { 
  static uint32_t x = 123456789;
  static uint32_t y = 362436069;
  static uint32_t z = 521288629;
  static uint32_t w = 88675123; 
  uint32_t t;
 
  t = x ^ (x << 11);
  x = y; y = z; z = w;
  return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); 
}

int main(){

    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

    int n, d;
    cin >> n >> d;

    assert(n <= 200000);

    vector<int> a(n);
    vector<int> v(n);
    int tmp;
    rep(i, n){
        cin >> tmp;
        a[i] = tmp;
        v[i] = a[i];
    }

    sort(ALL(v));

    rep(i, n){
        int tmp = a[i] - d;
        auto it = upper_bound(ALL(v), tmp);
        cout << it - v.begin() << endl;
    }

    return 0;
}