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 = tuple(map(int, input().split(' ')))
a = list(map(int, input().split(' ')))

a = sorted(a, reverse=True)

index = 0
count = 0

def sec(aj, ai):
    return aj < ai and aj >= ai-k

def bSearch(iai, a):
    if iai == len(a) - 1:
        return None
    if not sec(a[iai+1], a[iai]):
        return False

    high = len(a)
    low = iai

    while low < high-1:
        mid = (high+low)//2
        if sec(a[mid], a[iai]):
            low = mid
        else:
            high = mid

    return low

while index < len(a)-1:
    mid = bSearch(index, a)
    if mid == False:
        index += 1
        count += 1

    else:
        index += (mid-index)

print(count+1)

