from bisect import bisect_left

n, d = map(int, input().split())

A = [0 for _ in range(n)]

for i in range(n):
    A[i] = int(input())

B = sorted(A)

for a in A:
    print(bisect_left(B, a - d + 1))