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 long long N = 2e5 + 7;
const long long M = 8007;
const long long mod = 5e9 + 7;
long long n, k;
long long a[N];
int main() {
  scanf("%lld%lld", &n, &k);
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &a[i]);
  }
  sort(a + 1, a + n + 1);
  int ans = 0;
  for (int i = 2; i <= n; i++) {
    if (a[i - 1] + k < a[i]) {
      int j = i;
      while (a[j] == a[i]) {
        ans += 1;
        j -= 1;
      }
    }
  }
  int j = n;
  while (a[j] == a[n]) {
    j -= 1;
    ans += 1;
  }
  printf("%d\n", ans);
}
