#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
 
const int MOD=1e9+7;
const ll INF=1e18;
const int MAX=510000;
const double pi=acos(-1);
int dx[8] = {1,0,-1,0,1,1,-1,-1};
int dy[8] = {0,1,0,-1,-1,1,1,-1};

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false); 
  
  ll n,d;
  cin >> n >> d;
  vector<ll>a(n);
  rep(i,n) cin >> a[i];
  vector<vector<ll>> vec(n);
  rep(i,n){
    rep(j,n){
      if(i==j)continue;
      vec[i].emplace_back(a[j]);
    }
  }
  rep(i,n) sort(vec[i].begin(),vec[i].end());
  rep(i,n){
    ll ans = upper_bound(vec[i].begin(),vec[i].end(),a[i]-d)-vec[i].begin();
    cout << ans  << endl;
  }
  return 0;
}