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

from math import ceil, log
t = 1
for test in range(t):
	n,k = map(int, input().split())
	a = list(map(int, input().split()))
	a.sort()
	i = 0
	if n==1:
		print(1)
		continue
	tmp = 0
	store = 0
	while i < n-1:
		if a[i+1]>a[i]:
			if(-a[i]+a[i+1]<=k):
				tmp+=1
				tmp+=store
			store = 0
		else:
			store+=1
		i+=1
	print(n-tmp)

