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

inp = input()
n,k = inp.split()
n,k = int(n),int(k)
a = input()
a = [int(i) for i in a.split()]
a.sort()
print(a)
i,j,ans=n-1,n-2,0
while i>=0 and j>=0:
	if (a[i]<=a[j]+k) and (a[i]>a[j]):
		ans+=1
		j-=1
	elif i-1==j:
		i=i-1
		j=j-1
	else:
		i-=1
print(n-ans)