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.*;
import static java.lang.System.out;
import static java.lang.System.setProperty;


public  class Main {
   public static class numberpower{
        int i,j,k,b;
        numberpower(int x,int y,int z,int g){
            this.i=x;
            this.j=y;
            this.k=z;
            this.b=g;
        }

       @Override
       public String toString() {
           return this.i+" "+this.j+" "+this.k+" "+this.b;
       }
   }
    public static void main(String[] args) throws IOException {
        // TODO Auto-generated method stub
        Scanner S = new Scanner(System.in);
        BufferedReader BR = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter PW = new PrintWriter(new OutputStreamWriter(out));
        int n=S.nextInt(),k=S.nextInt();
        List<Integer>ans=new ArrayList<>();
        for (int i = 0; i < n; i++) {
            ans.add(S.nextInt());
        }
        List<Integer>remove=new ArrayList<>();
        if(n==1){System.out.println(1);System.exit(0);}
        while(true){

            Collections.sort(ans);

            for (int i = 0; i <ans.size()-1 ; i++) {
                if(ans.get(i)<ans.get(i+1)&&ans.get(i)+k>=ans.get(i+1)){continue;}
                else{remove.add(ans.get(i));}
            }
            remove.add(ans.get(ans.size()-1));
           // System.out.println(remove);
            if(remove.size()==ans.size()){break;}
            ans.clear();
            ans.addAll(remove);
            remove.clear();
        }
        System.out.println(ans.size());


    }



}