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() {
  std::ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n, m;
  cin >> n >> m;
  vector<pair<int, int> > wek;
  int tab[n], temp = 1;
  for (int i = 0; i < n; i++) {
    cin >> tab[i];
  }
  sort(tab, tab + n);
  for (int i = 0; i < n; i++) {
    if (i > 0) {
      if (tab[i] == tab[i - 1]) {
        temp++;
      } else {
        wek.push_back(make_pair(tab[i - 1], temp));
        temp = 1;
      }
    }
  }
  wek.push_back(make_pair(tab[n - 1], temp));
  int wynik = 0;
  for (int i = 1; i < wek.size(); i++) {
    if (wek[i].first <= wek[i - 1].first + m) wynik += wek[i - 1].second;
  }
  cout << n - wynik;
}
