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.Scanner;
public class b990 {
	public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);		
		int n = sc.nextInt();
		int K = sc.nextInt();
		int cnt=n;
		int[] a = new int[n];
		for(int i=0; i<n; i++) {
			a[i] = sc.nextInt();
		}
		
		do {
			int i1=0;
			int j1=-1;			
			for(int i=0; i<n; i++) {
				if (a[i]>a[i1] || (a[i]>0 && j1==-1)) {
					for(int j=0; j<n; j++) {
						if(a[j]>a[i] && a[j]<=a[i]+K) {
							i1=i;
							j1=j;
							break;
						}
					}
				}
			}
			if (j1>=0) {
				//System.out.println(i1+"->"+j1);
				a[i1]=-K;
				cnt-=1;			
			} else {
				break;
			}			
		} while (true);	
		System.out.println(cnt);
	}	
}