n,k = map(int,input().split())
B = list(map(int,input().split()))
def count_minimal(n,k,*A):
        A = list(A)
	i = 1
	count = 0
	while i <= n:
		for j in range(n):
		    if A[j] > min(A)+k:
			A = A[j:]
		count += 1
		i = len(A)
	return count
print(count_minimal(n,k,B))

 if A[j] > min(A) + k