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 go():
    n, k = (int(i) for i in input().split(' '))
    a = sorted([int(i) for i in input().split(' ')], reverse=True)
    if len(a) == 1:
        return 1
    to_remove = 0
    i = 0
    while n > i + 1:
        if a[i] > a[i + 1] and a[i] <= a[i + 1] + k:
            to_remove += 1
            if i + 2 < n and a[i + 1] == a[i + 2]:
                i += 1
                while i + 1 < n and a[i] == a[i + 1]:
                    to_remove += 1
                    i += 1
                    found = True
                if found:
                    i -= 1
        i += 1

    return n - to_remove

print(go())
