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.io.*;

public class Main
{
    public static void main(String args[])
    {
        int N;
        long K;
        Scanner sc = new Scanner(System.in);
        N=sc.nextInt();
        K=sc.nextLong();
        long B[] = new long[N];
        for(int i=0;i<N;i++)
        {
            B[i] = sc.nextLong();
        }
        Arrays.sort(B);
        for(int i=0;i<N-1;i++)
        {
            if(B[i+1]-B[i]<=K)
            {
                B[i]=0;
            }
        }
        int r=0;
        for(int i=0;i<N;i++)
        {
            if(B[i]!=0)
            {
               // System.out.print(B[i]+" ");
               r=r+1;
            }
        }
        System.out.print(r);
    }
}