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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.util.*;
import java.io.BufferedReader;
import java.io.InputStreamReader;

/**
 * @author Vikash Kumar(vikashkumarbissu)
 * NIT Silchar
 */

public class Main1 {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastReader in = new FastReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(1, in, out);
        out.close();
    }
    static class Task {
        public static int[] radixSort(int[] f){ return radixSort(f, f.length); }
        public static int[] radixSort(int[] f, int n) {
            int[] to = new int[n];
            {
                int[] b = new int[65537];
                for(int i = 0;i < n;i++)b[1+(f[i]&0xffff)]++;
                for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];
                for(int i = 0;i < n;i++)to[b[f[i]&0xffff]++] = f[i];
                int[] d = f; f = to;to = d;
            }
            {
                int[] b = new int[65537];
                for(int i = 0;i < n;i++)b[1+(f[i]>>>16)]++;
                for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];
                for(int i = 0;i < n;i++)to[b[f[i]>>>16]++] = f[i];
                int[] d = f; f = to;to = d;
            }
            return f;
        }
        public static void solve(int testNumber, FastReader in, PrintWriter out) {
            int n = in.nextInt();
            int k = in.nextInt();
            int[] arr = new int[n];
            int[] a = new int[(int)1e6 + 5];
            for (int i = 0; i < n; i++) {
                arr[i] = in.nextInt();
                a[arr[i]]++;
            }
            radixSort(arr);
            int count = 0;
            for (int i = 1; i < n; i++) {
                if (arr[i] > arr[i - 1] && arr[i] <= arr[i - 1] + k) {
                    //out.print(arr[i-1]+" ");
                    count += a[arr[i - 1]];
                }
            }
            out.println(n-count);
        }
    }

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader(InputStream is) {
            br = new BufferedReader(new
                    InputStreamReader(is));
        }

        public String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
        public int nextInt() {
            return Integer.parseInt(next());
        }

        public String nextLine() throws IOException {
            return br.readLine();
        }

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

        public double nextDouble() {
            return Double.parseDouble(next());
        }

    }
}