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.*;

public class MicroWorld 
{

	public static void main(String[] args)
	{
		Scanner sc = new Scanner(System.in);
		int bact = sc.nextInt();
		int K = sc.nextInt();
		
		Integer[] sizes = new Integer[bact];
		ArrayList<Integer> eaten = new ArrayList<Integer>();
		
		for (int i = 0 ; i < bact; i++)
		{
			sizes[i] = sc.nextInt();
		}
		
		Arrays.sort(sizes, Collections.reverseOrder());
		int lastIndex = 1;
		
		for (int i = 0; i < sizes.length; i++)
		{
			for (int j = lastIndex; j< sizes.length; j++)
			{
				if (sizes[i] <= sizes[j] + K)
				{
					if (sizes[i] > sizes[j])
					{
						eaten.add(j);
					}
				}
				else 
				{
					lastIndex = j;
					break;
				}
			}
		}
		
		System.out.println(sizes.length - eaten.size());
	}

}
