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

n, k = input().split()
k = int(k)
l = input().split()
l = list(map(int, l))
l.sort()
n= int(n)
if n==1:
    print(0)
else:

    f=l[0]
    arr=[]
    mat=[]
    c=0
    for i in range(len(l)):
        if l[i]==f:
            c=c+1
        else:
            mat.append(c)
            arr.append(f)
            f=l[i]
            c=1
    arr.append(f)
    mat.append(c)

    for i in range(1,len(arr)):

        if arr[i] - arr[i - 1] <= k :
            n=n-mat[i-1]

    print(n)
