#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N, D;
    cin >> N >> D;
    vector<int> A(N), AA(N);
    rep(i, N) { cin >> A[i]; }

    AA = A;
    sort(all(AA));

    rep(i, N) {
        int tar = A[i] - D;
        int ans = upper_bound(all(AA), tar) - AA.begin();
        cout << ans << endl;
    }
}