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.TreeMap;
import java.util.Scanner;

public class MicroWorld {

	public static void main(String[] args) {
		
		Scanner in = new Scanner(System.in);
		TreeMap<Integer,Integer> bacteria = new TreeMap<Integer,Integer>();
		int size = 0;
		
		int n = in.nextInt();
		int K = in.nextInt();
		int min = 10000000;
		
		for (int i = 0; i < n; i++) {
			int a = in.nextInt();
			if (bacteria.get(a) != null) {
				int f = bacteria.get(a);
				bacteria.remove(a);
				bacteria.put(a, f+1);
			}
			else {
				bacteria.put(a, 1);
				if (a < min) {
					min = a;
				}
			}
		}
		
		//remove min from bacteria but store how many there were
		int y = bacteria.get(min);
		int x = bacteria.get(min);
		bacteria.remove(min);
		
		while(bacteria.ceilingKey(min) != null) {
			// if min can't be removed, then add amount of mins to size
			int bigger = bacteria.ceilingKey(min);

			y = bacteria.get(bigger);
			
			if(min + K < bigger) {
				size = size + x;
			}

			min = bigger;
			x = bacteria.get(min);
			bacteria.remove(min);
		}
		
		System.out.println(size+y);
		
	}

}
