n, d = map(int, input().split())
A = [int(input()) for i in range(n)]
B = sorted(A)
ans = [0]*n
import bisect
for i, a in enumerate(A):
    b = a-d
    j = bisect.bisect_right(B, b)
    ans[i] = j
for i in range(n):
    print(ans[i])