#include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for(int i = 0; i < (int)n; ++i)
#define FOR(i, a, b) for(int i = a; i < (int)b; ++i)
#define rrep(i, n) for(int i = ((int)n - 1); i >= 0; --i)

using ll = long long;
using ld = long double;

const ll INF = 1e18;
const int Inf = 1e9;
const double EPS = 1e-9;
const ll MOD = 1e9 + 7;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(0);
	int n;
	ll d;
	cin >> n >> d;
	vector<ll> a(n), b(n);
	rep(i, n) { 
	  cin >> a[i];
	  b[i] = a[i];
	}
    sort(b.rbegin(), b.rend());
	rep(i, n) {
	  int l = 0, r = n, mid;
	  while (r - l > 1) {
		mid = (l + r) / 2;
		if (b[mid] + d <= a[i]) r = mid;
		else l = mid;
	  }
	  cout << n - r << endl;
	}
	

    return 0;
}