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

c = input().split()

n = int(c[0])
K = int(c[1])
a = input().split()

for b in range(len(a)):
    a[b] = int(a[b])
a.sort()

dead = 0
same = 0
last_dead = False
for j in range(len(a) - 1):
    i = j + 1
    if same > 0:
        if last_dead:
            dead += 1
        same -= 1
    else:
        while a[i] == a[j] and i < len(a) - 1:
            i += 1
            same += 1
        last_dead = False
        if a[i] <= a[j] + K and not a[i] == a[j]:
            dead += 1
            last_dead = True
print(len(a) - dead)