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

public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int K = sc.nextInt();
    int a[] = new int[n];
    int maxA = 0;
    for (int i = 0; i < n; i++) {
      a[i] = sc.nextInt();
      if (a[i] > maxA) {
        maxA = a[i];
      }
    }
    int maxCluster = 1 + (int)Math.floor(maxA / K);
    System.err.println("maxA: " + maxA);
    System.err.println("maxcluster: " + maxCluster);
    int max[] = new int[maxCluster];
    int min[] = new int[maxCluster];
    int count[] = new int[maxCluster];
    for (int i = 0; i < n; i++) {
      int idx = (int)Math.floor(a[i] / K);
      if (max[idx] == 0) {
        max[idx] = min[idx] = a[i];
        count[idx] = 1;
      } else if (max[idx] < a[i]) {
        max[idx] = a[i];
        System.err.println("got new max: " + max[idx]);
        count[idx] = 1;
      } else if (min[idx] > a[i]) {
        min[idx] = a[i];
      } else if (max[idx] == a[i]) {
        count[idx]++;
      }
    }
    int result = 0;
    for (int i = 0; i < maxCluster; i++) {
      if (i == 0) {
        if (max[i] > 0) {
          result = count[i];
          System.err.println("starting with: " + result);
        }
        continue;
      }
      result += count[i];
      if (min[i] - max[i-1] > K) {
        System.err.println("part " + result);
      } else if (min[i] > max[i-1]) {
        result -= count[i-1];
        System.err.println("three " + result);
      }
    }
    System.out.println(result);
  }
}
