import bisect

_,D,*A = map(int,open(0).read().split())

B = sorted(A)

for a in A:
    if a <= D:
        print(0)
        continue
    C = B[:B.index(a)]
    print(len(C[:bisect.bisect_right(C, a-D)]))