#include <iostream>
#include <string>
#include <algorithm>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int a[200020];
int main() {
    vector<int> vec;
    int n, d;
    cin >> n >> d;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        vec.emplace_back(a[i]);
    }
    sort(vec.begin(), vec.end());
    for (int i = 0; i < n; i++) {
        auto itr = upper_bound(vec.begin(), vec.end(), a[i] - d);
        cout << distance(vec.begin(), itr) << endl;
    }
}