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;
void solve() {
  long long n, k;
  cin >> n >> k;
  long long a[n];
  for (long long i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  long long cnt = 0, same = 1, idx = -1;
  for (long long i = 0; i < n - 1; i++) {
    if (a[i] == a[i + 1]) {
      same++;
      idx = i;
    }
    if (same > 0 && a[i + 1] > a[i] && a[i + 1] <= (k + a[i]) && i == idx + 1) {
      cnt += same;
    } else if (a[i + 1] > a[i] && a[i + 1] <= k + a[i]) {
      cnt++;
    }
  }
  if (n - cnt == 0)
    cout << 1;
  else
    cout << n - cnt;
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long t;
  t = 1;
  while (t--) {
    solve();
  }
}
