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;
signed main() {
  long long n, k;
  cin >> n >> k;
  vector<long long> line(n);
  for (long long& i : line) cin >> i;
  sort(line.begin(), line.end());
  long long ans = n;
  long long same = 0;
  for (long long i = 0; i < n - 1; i++) {
    if (i > 0 && line[i] == line[i - 1])
      same++;
    else
      same = 1;
    if (line[i + 1] > line[i] && line[i + 1] <= line[i] + k) ans -= same;
  }
  cout << ans << endl;
  return 0;
}
