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.*;
import java.lang.*;

public class micro_world{

	public static void main(String args[]){

		Scanner sc = new Scanner(System.in);

		int n=sc.nextInt();
		int k=sc.nextInt();
		int c=0;
		int t=0;
		int u=0;

		int a[]=new int[2000001];
		int b[]=new int[n];
		
		for(int j=0;j<n;j++){
			t=sc.nextInt();
		//	System.out.println("@"+t+" "+a[t]+"&"+u+" "+b[u]);
			if(a[t]==0){
			//	System.out.print("*");
				b[j]=t;
				u++;
			}
			else
				b[j]=300000;
			a[t]++;
		//	System.out.println(t+" "+a[1]+"&"+u+" "+b[u-1]);
			
		}
		if(u==1){
		//	System.out.print("*");
			System.out.print((a[b[u-1]]));
		}

		
	//	Arrays.sort(b)
		
		
		else{
		Arrays.sort(b);
		for(int i=0;i<n-1;i++){

			if(b[i+1]-b[i]==k){
				a[b[i]]=0;
			}
			
		}
		
			
		for(int m=0;m<n-1;m++){
	//		System.out.println("%"+a[b[m]]);
			if(a[b[m]]>0)
				c++;	
		}
		
		
		System.out.print(c);
		}
	}
}