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;
void print(vector<int> &a) {
  for (unsigned long long i = 0; i < a.size(); i++) cout << a[i] << " ";
  cout << endl;
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  for (unsigned long long i = 0; i < n; i++) cin >> a[i];
  sort(a.begin(), a.end());
  print(a);
  bool vis[n];
  memset(vis, true, sizeof(vis));
  for (unsigned long long i = 0; i < a.size() - 1; i++) {
    auto p2 = lower_bound(a.begin() + i + 1, a.end(), a[i] + k);
    if (p2 == a.end()) {
      p2--;
      if ((*p2) <= a[i] + k && (*p2) > a[i])
        vis[i] = false;
      else
        vis[i] = true;
    } else {
      if (*p2 != a[i] + k) p2--;
      if (p2 == a.begin() + i)
        ;
      else if (*p2 <= a[i] + k)
        vis[i] = false;
    }
  }
  int ans = 0;
  for (unsigned long long i = 0; i < n; i++)
    if (vis[i]) ans++;
  cout << ans;
  return 0;
}
