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;
int main() {
  int n, k, a[200001], i, t = 0, j, sum, h = 0, x = 0;
  cin >> n >> k;
  for (i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a, a + n);
  sum = 0;
  if (a[0] == a[n - 1]) {
    cout << n;
    return (0);
  }
  for (i = 1; i < n; i++) {
    if (a[i] - a[i - 1] > k) {
      t++;
      sum = t + x;
    }
  }
  for (i = n - 1; i > 1; i--) {
    if (a[i] - a[i - 1] > k && a[i - 2] - a[i - 1] == 0) {
      for (j = i - 2; j > 0; j--) {
        h++;
        if (a[j] - a[i - 1] < 0) {
          break;
        }
      }
      x = x + h;
      h = 0;
    }
  }
  cout << sum + x + 1;
}
