/**
*    author:  yuya1234
*    created: 10.07.2020 21:42:50
**/

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)

#define ALL(x) x.begin(),x.end()
#define SORT(x) sort(x.begin(),x.end())
#define SORTD(x) sort(x.rbegin(),x.rend())
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define SZ(x) ll(x.size())

#define MEMSET(v, h) memset((v), h, sizeof(v))

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

  int n,d;
  cin>>n>>d;
  
  int a[n],aa[n],ans;
  REP(i,n)
  {
    cin>>a[i];
    aa[i]=a[i];
  }

  sort(aa,aa+n);

  REP(i,n)
  {
    ans=0;
    if(a[i]<=d)
    {
      cout<<0<<endl;
      continue;
    }
    REP(j,n)
    {
      if(i!=j && (a[i]-a[j]>=d))ans++;
    }
    cout<<ans<<endl;
  }




  return 0;
}