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;
vector<pair<int, int> > a;
unordered_map<int, int> um;
int n;
int m;
bool eat(pair<int, int> x, pair<int, int> y) {
  if (x.first > y.first && y.first + m >= x.first) return true;
  return false;
}
int main() {
  cin >> n >> m;
  int x;
  for (int k = 0; k < n; k++) {
    cin >> x;
    um[x]++;
  }
  for (auto i : um) {
    a.push_back(make_pair(i.first, i.second));
  }
  sort(a.begin(), a.end());
  int s = 0;
  for (int k = 0; k < a.size() - 1; k++) {
    if (eat(a[k + 1], a[k])) {
      s += a[k].second;
    }
  }
  cout << n - s;
  return 0;
}
