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

n,k = [int(n) for n in input().split()]
b_sizes = [int(n) for n in input().split()]
b_d = {}
b_s_u = []
deaths = 0
for i in b_sizes:
    if i in b_d:
        b_d[i] += 1
    else:
        b_d[i] = 1
        b_s_u.append(i)
b_s_u.sort()
for j in range(len(b_s_u)-1):
    if b_s_u[j] < b_s_u[j+1] and b_s_u[j+1] <= b_s_u[j] + k:
        deaths = deaths + b_d[b_s_u[j]]
print(n - deaths)