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=map(int,input().split())
l=[int(i) for i in input().split()]
l.sort() 
st=0 
sm=0 
mini=10**9 
#print(l)
ans=0 
f=0 
alive=[]
for end in range(n): 
    while l[end]-l[st]<=k and l[end]!=l[st]:
        st+=1 
    while l[end]-l[st]>k:
        alive.append(st)
        st+=1 
        f=1 
        ans+=1 
for i in range(st+1,n):
    alive.append(i)
#print(alive)
print(len(alive)+1)