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 = map(int, input().split())
mas = list(map(int, input().split()))
mas.sort()
mas = [el + K for el in mas]
gas = mas.copy()
has = []
f = n
k = 0
while True:
    mas = gas.copy()
    for a in range(len(mas) - 1):
        o = mas[a]
        b = mas[a + 1]
        if o != b and o >= b - K:
            f -= 1
            gas[a] = ''
    gas = [el for el in gas if el != '']
    gas.sort()
    if has != gas:
        has = gas.copy()
        k = 0
    else:
        k += 1
    if k == 4:
        break
print(f)