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 upper_bound(arr, i):
    l = i
    r = len(arr) - 1
    while r - l != 1:
        m = (r + l) / 2
        if arr[m] > arr[i]:
            r = m
        else:
            l = m

    return r

n, K = map(int, raw_input().split())
bacteria = sorted(list(map(int, raw_input().split())))
bacteria.append(bacteria[-1] + K + 1)

result = 0
for i in range(n):
    next_index = upper_bound(bacteria, i)
    if bacteria[next_index] - bacteria[i] > K:
        result += 1

print result
