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.io.*;
import java.util.*;
public class Asd {
static PrintWriter w=new PrintWriter(System.out);
static FastScanner s=new FastScanner();
	public static void main(String[] args) {
		
		int t=1;//s.nextInt();
		while(t-->0)
                {
		    solve();
		}
	       w.close();}
        public static void solve()
        {
            int n=s.nextInt();
            int k=s.nextInt();
            int arr[]=new int[1000001];
            for(int i=0;i<n;i++)
                  arr[s.nextInt()]++;
            int sum=0;
            int prev=-1;
            for(int i=1;i<=1000000;i++)
            {
                if(arr[i]!=0&&prev==-1)
                    prev=i;
                else if(arr[i]!=0&&prev!=-1)
                {
                    if(prev+k>=i)
                    arr[prev]=0;
                    prev=i;
                }   
            }
                        for(int i=1;i<=1000000;i++)
                     sum+=arr[i];
                        w.println(sum);
                
            
        }
	
	static class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
		public String next() {
			while (!st.hasMoreElements())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}
		int[] readArray(int n) {
			int[] a=new int[n]; 
			for (int i=0; i<n; i++) a[i]=nextInt();
			return a;
		}
		
		int nextInt () {
			return Integer.parseInt(next());
		}
	}

}
