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;
set<long long> s;
int main() {
  long long n, k, i, ans, temp, x;
  cin >> n >> k;
  for (i = 0; i < n; i++) {
    cin >> x;
    s.insert(x);
  }
  ans = s.size();
  if (s.size() == 1) {
    cout << n;
    exit(0);
  }
  set<long long>::iterator it = s.begin();
  temp = *it;
  it++;
  for (; it != s.end(); it++) {
    if (*it > temp && *it <= temp + k) {
      ans--;
    }
    temp = *it;
  }
  cout << ans;
  return 0;
}
