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;
int main() {
  int n, k, ele, count = 0;
  cin >> n >> k;
  set<int> s;
  set<int>::iterator it, pre;
  unordered_map<int, int> mp;
  while (n--) {
    cin >> ele;
    if (mp.find(ele) == mp.end())
      mp[ele] = 1;
    else
      mp[ele] = mp[ele] + 1;
    s.insert(ele);
  }
  it = s.begin();
  it++;
  if (it == s.end())
    cout << mp[ele] << endl;
  else {
    while (it != s.end()) {
      it--;
      pre = it;
      it++;
      if (*it > *pre && *it - *pre <= k) {
      } else
        count += mp[*pre];
      it++;
    }
    it--;
    count += mp[*it];
    cout << count << endl;
  }
  return 0;
}
