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 os, sys, math
from bisect import *

def main():
	n,k = [int(x) for x in input().split()]
	a = [int(x) for x in input().split()]
	a.sort(reverse=True)
	ans = 1
	eat_till = a[0] - k
	dont_eat = a[0]
	for x in a[1:]:
		debug("current: ",x," ... eating between [",dont_eat-1,",",eat_till,"], current ans:",ans,end=" ")
		if dont_eat > x >= eat_till:
			debug("eaten")
			eat_till = x - k
		else:
			ans += 1
			debug("added")
			eat_till = x - k
			dont_eat = x
	print(ans)

def debug(*args,**kwargs):
	if 'DEBUG' in os.environ:
		print(*args,**kwargs)

if __name__ == '__main__':
	main()