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(i) for i in input().split()]
sizes = sorted([int(i) for i in input().split()])

def eated(ai, aj):
    return (ai > aj) and (ai <= (aj+k))

sizes_eaten = 0
last_eated_index = 0
for i, size_i in enumerate(sizes):
    for j, size_j in enumerate(sizes[last_eated_index+1:i]):
        if eated(size_i, size_j):
            last_eated_index += j
            sizes_eaten += 1
print(n - sizes_eaten)