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())
a = map(int,input().split())
a = sorted(a)
b = []
for v in a:
    if len(b) == 0:
        b.append([v,1])
    else:
        if v==b[-1][0]:
            b[-1][1] += 1
        else:
            b.append([v,1])
cnt = 1
i = 0
p = 1
while i < len(b)-1:
    if b[i][0]<b[i+1][0] and b[i][0]+k>=b[i+1][0]:
        pass
    else:
        cnt += b[i][1]
    i += 1
#print(a)
#print(b)
print(cnt)
