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() {
  long long int n, k, m, e;
  vector<long long int> l;
  cin >> n >> k;
  for (long long int i = 0; i < n; i++) {
    cin >> m;
    l.push_back(m);
  }
  long long int r = 1;
  n = e = l.size();
  sort(l.begin(), l.end());
  for (long long int i = 0; i < n - 1; i++) {
    if (l[i] == l[i + 1])
      r++;
    else if (l[i] < l[i + 1] && l[i] + k >= l[i + 1]) {
      e -= r;
      r = 1;
    }
  }
  cout << e << endl;
}
