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

#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Mon Dec 31 09:07:17 2018

@author: umang
"""

n, k = map(int, input().split())

a = list(map(int, input().split()))

a.sort()

count = len(a)

i = 0

eq_count = 0

while i < (len(a)):
    if i == len(a) - 1:
        break
    j = i+1
    if a[i] < a[j] and a[j] <= a[i] + k:
        count -= (eq_count+1)
        eq_count = 0
    if a[i] == a[j]:
        eq_count += 1
    i += 1
    
print(count)
        