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

public class Main
{
	public static void main (String[] args) throws java.lang.Exception
	{
	FastReader sc=new FastReader();
	int n=sc.nextInt();
	int k=sc.nextInt();
	int[] e = new int[1000005];
	ArrayList<Integer> a=new ArrayList<Integer>();
//	ArrayList<Integer> b=new ArrayList<Integer>();
	
	for(int i=0;i<n;i++)
	{
	    int y=sc.nextInt();
	   
	    if (e[y] == 0) {
                a.add(y);
            }

            e[y]++;
	}
	
	Collections.sort(a);
	
        int i=1;
        int c=0;
	while(i<a.size())
	{
	   if(a.get(i)>a.get(i-1) && a.get(i)<=((long)a.get(i-1)+(long)k))
	   {
	       //System.out.println(a.get(i-1));
	       //a.remove(i-1);
	       //b.remove(i-1);
	       c=c+e[a.get(i-1)];
	       
	   }
	  
	   i++;
	   
//	}
	//j++;
    }
	
	//for(int m=0;m<a.size();m++)
//	c+=e[a.get(m)];
	System.out.println(n-c);

	}
}

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 (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

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

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

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

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