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_left as bs
if __name__ == "__main__":
	n, k = [int(_) for _ in input().strip().split()]
	arr = [int(_) for _ in input().strip().split()]
	arr.sort()
	l = []
	for i in range(n):
		if len(l) == 0:
			l.append(arr[i])
		else:
			while len(l) > 0 and l[-1] + k >= arr[i] and l[-1] < arr[i]:
				l.pop()
			l.append(arr[i])
	print(len(l))
