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;
long long n, i, j, k, l, m, arr[200010], x, a, b, c, d,
    od = 0, ev = 0, arr1[200010], p, hi, lo, mid, s, y, t, res = 0;
map<long long, long long> mp, mp1;
vector<long long> vc, vc1;
string st, st1;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  for (i = 0; i < n; i++) {
    cin >> arr[i];
    if (mp.find(arr[i]) == mp.end())
      mp[arr[i]] = 1;
    else
      mp[arr[i]]++;
  }
  for (map<long long, long long>::iterator it = mp.begin(); it != mp.end();
       it++) {
    vc.push_back(it->first);
  }
  res = mp[vc[int(vc.size()) - 1]];
  for (i = 0; i < int(vc.size()) - 1; i++) {
    if (vc[i + 1] - vc[i] > k) {
      res += mp[vc[i]];
    }
  }
  cout << res;
}
