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

import copy 
n,k=list(map(int,input().split()))
li=list(map(int,input().split()))
stack=copy.deepcopy(li)
stack.sort(reverse=True)
for i in range(len(li)):
    li[i]=li[i]+k
li.sort()
ans=n
i=0
print(li)
while i<n and len(stack)>0:
    po=len(stack)-1
    while  len(stack)>0 and li[i]-k==stack[po]:
        stack.pop()
        po=len(stack)-1
        
    
    if  len(stack)>0 and stack[po]<=li[i]:
        i=i+1
        ans=ans-1
    elif len(stack)>0 and stack[po]>li[i]:
        i=i+1
print(ans)
            
        
    

    
       
