#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i ++)
using namespace std;
using ll = long long;
using PL = pair<ll,ll>;
using P = pair<int,int>;
constexpr int INF = 1000000000;
constexpr long long HINF = 1000000000000000;
constexpr long long MOD = 1000000007;// = 998244353;
constexpr double EPS = 1e-4;
constexpr double PI = 3.14159265358979;
const int tyou[7] = {0,2,4,5,7,9,11};

int main() {
    int N,D; cin >> N >> D;
    vector<int> A(N);
    rep(i,N) cin >> A[i];
    vector<int> B = A;
    sort(B.begin(),B.end());
    vector<int> ans(N);

    rep(i,N) {
        int cnt = upper_bound(B.begin(),B.end(),A[i]- D) - B.begin();
        ans[i] = cnt;
    }
    rep(i,N) cout << ans[i] << '\n';
    return 0;
}