#include using namespace std; int main() { int N; long long D; cin >> N >> D; vector A( N ); for( int i = 0; i < N; i++ ) { cin >> A[i]; } vector a = A; sort( a.begin(), a.end() ); for( int i = 0; i < N; i++ ) { long long d = A[i] - D; int ans = upper_bound( a.begin(), a.end(), d ) - a.begin(); cout << ans << endl; } }