#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

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

    int N, D;
    cin >> N >> D;
    vector<int> A(N), nums(N);
    for(int i = 0; i < N; ++i){
        cin >> A[i];
        nums[i] = A[i];
    }
    sort(nums.begin(), nums.end());
    nums.erase(unique(nums.begin(), nums.end()), nums.end());
    int M = nums.size();
    vector<int> S(M + 1);
    for(int i = 0; i < N; ++i){
        int j = lower_bound(nums.begin(), nums.end(), A[i]) - nums.begin();
        S[j + 1] += 1;
    }
    for(int i = 0; i < M; ++i)  S[i + 1] += S[i];
    for(int i = 0; i < N; ++i){
        int j = lower_bound(nums.begin(), nums.end(), A[i] - D) - nums.begin();
        if(nums[j] == A[i] - D) cout << S[j + 1] << '\n';
        else    cout << S[j] << '\n';
    }
    
    return 0;
}