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

import java.util.*;
public class B {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int k = sc.nextInt();
		int[] a = new int[n];
		int[] count = new int[1000001];
		HashSet<Integer> hs = new HashSet();
		for(int i=0;i<n;i++){
			a[i] = sc.nextInt();
			count[a[i]]++;
			hs.add(a[i]);
		}
		int[] temp = new int[hs.size()];
		int ii=0;
			Iterator<Integer> itr = hs.iterator();
			while(itr.hasNext()){
				temp[ii]=itr.next();
			    ii++;
			}
		Arrays.sort(temp);
		int alive=0;
		int len = hs.size();
		
		for(int i=0;i<len-1;i++){
			if(temp[i+1]>temp[i]+k){
				alive = alive + count[temp[i]];
			}
		}
		alive = alive + count[temp[len-1]];
		System.out.println(alive);
		
		
	}

}