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 a[531551];
long long arr[6546554];
map<long long, long long> mp;
signed main() {
  long long n, m;
  cin >> n >> m;
  set<long long> ss;
  for (long long i = 1; i <= n; i++) {
    cin >> a[i];
    ss.insert(a[i]);
  }
  if (ss.size() == 1) {
    cout << n << '\n';
    return 0;
  }
  sort(arr + 1, arr + 1 + n);
  long long sum = 0;
  long long cnt = 0;
  for (long long i = 1; i <= n; i++) {
    if (!mp[a[i]]) {
      arr[cnt++] = a[i];
    }
    mp[a[i]]++;
  }
  sort(arr, arr + cnt);
  for (long long i = 0; i < cnt - 1; i++) {
    if (arr[i] + m >= arr[i + 1] && arr[i + 1] > arr[i]) {
      sum += mp[arr[i]];
    }
  }
  cout << n - sum;
  return 0;
}
