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

#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
const int mod = 1e8 + 7;
int n, k;
int a[maxn];
int main() {
  while (~scanf("%d%d", &n, &k)) {
    for (int i = 0; i < n; i++) {
      scanf("%d", &a[i]);
    }
    sort(a, a + n);
    int ans = 0;
    int tmp = 0;
    for (int i = 1; i < n; i++) {
      if (a[i] - a[i - 1] <= k && a[i] - a[i - 1] > 0) {
        tmp = 1;
      } else if (a[i] == a[i - 1]) {
        if (a[i] != a[i - 2])
          tmp += 2;
        else
          tmp++;
      } else {
        ans += tmp;
        tmp = 0;
      }
    }
    if (a[1] - a[0] > k) ans++;
    printf("%d\n", ans + tmp);
  }
  return 0;
}
