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 java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution{

    public static void main(String[] args)
    {
        Scanner s= new Scanner(System.in);
        int n=s.nextInt();
        int k=s.nextInt();
        int a[]=new int[n];
        int f[]=new int[1000001];
        ArrayList<Integer> arr=new ArrayList<Integer>();
        for(int i=0;i<n;i++)
        {
            a[i]=s.nextInt();
            if(f[a[i]]==0)
                arr.add(a[i]);
            f[a[i]]++;
        }
        for(int i=1;i<1000001;i++)
            f[i]=f[i-1]+f[i];
        int l=arr.size();
        int count=0;
        for(int i=0;i<l;i++)
        {
            int curr=arr.get(i);
            if(curr-k-1>=0 && curr-1>=0)
                count+=f[curr-1]-f[curr-k-1];
        }
        System.out.println(n-count);
	}
}