import bisect

def main():
    import sys
    input = sys.stdin.read().split()
    idx = 0
    N = int(input[idx])
    idx += 1
    D = int(input[idx])
    idx += 1
    A = []
    for _ in range(N):
        A.append(int(input[idx]))
        idx += 1
    B = sorted(A)
    for a in A:
        x = a - D
        count = bisect.bisect_right(B, x)
        print(count)

if __name__ == '__main__':
    main()