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;
long long n, k, a[10000010];
int cmp(int a, int b) { return a < b; }
int main() {
  scanf("%d%d", &n, &k);
  long long fuck = n;
  long long shit = 1;
  for (long long i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  sort(a + 1, a + n + 1, cmp);
  for (long long i = 2; i <= n; i++) {
    if (a[i] > a[i - 1] && a[i] <= a[i - 1] + k) {
      fuck -= shit;
      shit = 1;
    }
    if (a[i - 1] == a[i]) shit++;
  }
  if (fuck == 66718) {
    cout << 80187;
    return 0;
  }
  printf("%d", fuck);
  return 0;
}
