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

public class Q5 {
	public static void main(String[] args) {
		
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int k = in.nextInt();
		int a[] = new int[n];
		int countRemoved = 0;
		int countMightRemove = 0;
		int i;
		Random r = new Random();
		int index;
		
		for(i = 0; i < n; i++) {
			a[i] = in.nextInt();
		}
		
		// shuffle
		for (i = n - 1; i > 0; i--) {
			index = r.nextInt(i + 1);
			if(i == index) 
				continue;
			a[i] = a[i] ^ a[index];
			a[index] = a[i] ^ a[index];
			a[i] = a[i] ^ a[index];
		}
		
		Arrays.sort(a);
		
		for (i = 1; i < n; i++) {
			
			if(a[i] == a[i-1]) {
				countMightRemove++;
				continue;
			}
			if(i > 1 && a[i] <= a[i-1] + k && a[i-1] == a[i-2]) {
				countRemoved += 1 + countMightRemove;
				countMightRemove = 0;
				continue;
			}
			if(a[i] <= a[i-1] + k) {
				countRemoved += 1;
				countMightRemove = 0;
				continue;
			}
		}
		
		int result = n - countRemoved;
		
		System.out.println(result);
		
	}

}
