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>
std::vector<std::vector<int>> vec;
using namespace std;
long long mod = 1e9 + 7;
int ans = 0;
void solve() {
  long long n, k;
  scanf("%lld%lld", &n, &k);
  vector<int> t, v(n);
  set<int> s;
  for (int i = 0; i < n; i++) {
    scanf("%d", &v[i]);
    s.insert(v[i]);
  }
  for (auto i : s) t.push_back(i);
  vector<bool> aa(1e6 + 1, 0);
  for (int i = 0; i + 1 < t.size(); i++) {
    if (t[i + 1] - t[i] <= k) aa[t[i]] = 1;
  }
  for (auto i : v) ans += aa[i];
  cout << n - ans << endl;
}
int main() {
  solve();
  return 0;
}
