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.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.TreeSet;


public class Main {
    public static StreamTokenizer tokenizer = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));

    public static int read() throws IOException {
        tokenizer.nextToken();
        return (int) tokenizer.nval;
    }


    public static void main(String[] args) throws IOException {
        int n=read();
        int k=read();
        int[] arr=new int[n];
        for (int i=0; i<n; i++){
            arr[i]=read();
        }
        int cnt=n;
        int[] counts=new int[1000000];
        for (int i=0; i<n; i++) counts[arr[i]-1]++;
        ArrayList<Integer> sizes=new ArrayList<Integer>();
        for (int i=0; i<1000000; i++){
            if (counts[i]!=0) sizes.add(i);
        }
        for (int i=0; i<sizes.size()-1; i++){
            if (sizes.get(i+1)<=sizes.get(i)+k) cnt-=counts[sizes.get(i)];
        }
        System.out.println(cnt);
    }

}

