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.Scanner;
public class Test8   {
    public static void main(String[] Args)   {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int k = sc.nextInt();
        int[] cnt = new int[1000001];
        int[] s = new int[n];
        for (int i = 0; i < n; i++)   {
            s[i] = sc.nextInt();
            cnt[s[i]]++;
        }    
        int n1 = 0;
        int n2 = 0;
        int ct = 0;
        int sum = 0;
        for (int i = 1; i <= k; i++)   {
            sum += cnt[i];
        }    
        for (int i = 0; i <= 999999; i++)   {
            if (sum == 0 ) ct += cnt[i];
            sum -= cnt[i + 1];
            if (k + i + 1<= 1000000) sum += cnt[k + i + 1];
        }    
        System.out.println(ct + cnt[1000000]);
    }    
}    