2 1
1 1
 4 1
2 2 1 1
 10 1
2 6 3 4 2 4 4 3 2 1
 2 1
999152 999153
 8 1000000
1 1 5 1000000 1000000 2 2 2
 9 2
1 6 1 5 5 8 6 8 7
 15 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
 1 4
8
 10 1
6 3 1 3 6 4 1 3 6 4
 10 1
1 2 3 5 6 8 10 11 9 4
 7 2
1 5 5 8 9 8 8
 2 1000000
1 1000000
 8 2
3 13 9 8 3 13 9 14
 1 1
1
 2 1
1 2

2
 2
 4
 1
 2
 4
 15
 1
 7
 2
 4
 1
 5
 1
 1

def binarySearch(n,i,k,a):
    l=i+1
    u=n-1
    ans=0
    while l<=u:
        mid=int((l+u)/2)
        if a[mid]==a[i] : 
            l=mid+1
        elif a[mid]-a[i]<=k:
            ans=1
            break
        else:
            u=mid-1
    return ans


n,k=map(int,input().split())
a=list(map(int,input().split()))

a.sort()
#print(str(a))
visited=[]
for i in range(0,n):
    visited.append(0) 
i=0
j=1
ctr=0
for i in range (0,n):
    val=binarySearch(n,i,k,a)
    ctr+=val

# print(str(visited))

print(n-ctr)




