N,D = map(int,input().split())
A = [int(input()) for _ in range(N)]
A = [(A[i],i) for i in range(N)]
A = sorted(A,key=lambda x:x[0],reverse=True)
B = [0 for _ in range(N)]
i = 0
j = i+1
while i<N:
    a = A[i][0]
    flag = 0
    while j<N:
        b = A[j][0]
        if a-b>=D:
            flag = 1
            break
        j += 1
    if flag==1:
        B[A[i][1]] = N-j
    i += 1
for i in range(N):
    print(B[i])