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;
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long n, K;
  cin >> n >> K;
  vector<long long> v(n);
  for (long long _i = 0; _i < (long long)v.size(); ++_i) cin >> v[_i];
  sort(v.begin(), v.end());
  long long res = 0;
  for (long long i = 0; i < n; ++i) {
    long long j = i, cnt = 0;
    while (v[j] == v[i]) {
      j++;
      if (j == n) break;
    }
    if (j == n)
      res += j - i;
    else if (v[i] + K < v[j])
      res += j - i;
    i = j - 1;
  }
  cout << res << endl;
  return 0;
}
