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

def position(sub, main):
  for i in range(len(main) - len(sub)):
    if main[i : i + len(sub)] == sub:
      return(i)
  return(-1)
n = input()
m = int(n[0 : position(' ', n)])
n = int(n[position(' ', n) : ])
string = input()
array = []
while position(' ', string) != -1:
  array.append(int(string[0 : position(' ', string)]))
  string = string[position(' ', string) + 1 : ]
array.append(int(string))
array.sort()
print(array)
answer = 0
j = 0
while j < len(array) - 1:
  if (array[j] < array[j + 1]) and (array[j] + n >= array[j + 1]):
    array.pop(j)
    j = 0
    continue
  j += 1
print(len(array))
