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

s = input().split()
n, K = int(s[0]), int(s[1])

d = input().split()
d = [int(i) for i in d]
d.sort()

c = 0
#print(d)
for i in range(n - 1):
    if d[i+1] - d[i] <= K and d[i+1] > d[i]:
        c += 1
        #print('{} eats {}'.format(d[i+1], d[i]))
        if i > 0:
            if d[i] == d[i-1]:
                j = i-1
                while d[j] == d[i]:
                    #print('{} eats {}'.format(d[i + 1], d[j]))
                    j -= 1
                    c += 1
        continue


print(n - c)