n,c = map(int,input().split())
a = list(map(int,input().split()))
b = sorted(a)

cnt = 0
# A = B + C
def ef(l,r,n):
    global cnt
    while l < r:
        mid = (l + r) // 2
        if b[mid] >= n:
            r = mid
        else:
            l = mid + 1
    if l == r:
        if b[l] == n:
            cnt += 1
        else:
            cnt = cnt
        
for i in range(len(b)):
    d = b[i] + c
    ef(0,len(b)-1,d)
print(cnt)