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 bisect import bisect_right as br
from bisect import bisect_left as bl
from math import ceil 
ar = map(int , raw_input().split())
r = map(int , raw_input().split())
dic  = {}
for  i in r:
	if i in dic:
		dic[i] += 1
	else:
		dic[i] = 1
r = dic.keys()

r.sort()
le = 0
for i in range(0, len(r)-1):
	if r[i] < r[i+1] and r[i]+ar[1] >= r[i+1]:
		le+= dic[r[i]]
print ar[0]-le
		

