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.PrintWriter;
import java.text.DecimalFormat;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

public class Test {

    static Scanner in = new Scanner(System.in);
    static PrintWriter out = new PrintWriter(System.out);

    public static void main(String[] args) {
        int n = in.nextInt();
        int k = in.nextInt();

        ArrayList<Integer> a = new ArrayList<>();

        for (int i=0;i<n;i++) {
            a.add(in.nextInt());
        }

        Collections.sort(a);
        boolean arr[] = new boolean[n];

        for (int i=0;i<n-1;i++)
        {
            if (a.get(i+1)>a.get(i) && a.get(i+1)<=(a.get(i)+k))    arr[i] = true;
        }

        int count=1;
        int llimit = a.get(n-1)-k;
        int ulimit = a.get(n-1)-1;

        for (int i=n-2;i>=0;i--)
        {
            int x = a.get(i);
            if (x>=llimit && x<=ulimit)
            {
                ulimit = x;
                llimit = x-k;
            }
            else
            {
                count++;
                llimit = x-k;
                ulimit = x-1;
            }
        }

        System.out.println(count);
    }
}