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.BufferedReader;
import java.io.InputStreamReader;
import java.util.Iterator;
import java.util.Map;
import java.util.StringTokenizer;
import java.util.TreeMap;

public class BB {
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new
                    InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (Exception e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (Exception e) {
                e.printStackTrace();
            }
            return str;
        }
    }

    public static void main(String args[]) {
        FastReader reader = new FastReader();

        long n = reader.nextLong();
        long k = reader.nextLong();

        TreeMap<Long, Integer> treeMap = new TreeMap<>();

        for (int i = 0; i < n; i++) {
            long x = reader.nextLong();
            if(treeMap.containsKey(x)) {
                treeMap.put(x, treeMap.get(x) + 1);
            } else {
                treeMap.put(x, 1);
            }
        }
        long prev = -911111111111111l;

        Iterator<Map.Entry<Long, Integer>> iterator = treeMap.entrySet().iterator();
        while(iterator.hasNext()) {
            Map.Entry<Long, Integer> next = iterator.next();
            long key = next.getKey();
            if(key > prev && prev + k >= key) {
                n -= treeMap.get(prev);
            }
            prev = key;
        }
        System.out.println(n);
    }
}
