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;
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.second < b.second);
}
int main() {
  long long n, k;
  cin >> n >> k;
  vector<long long> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a.begin(), a.end());
  int cnt = 0;
  int loc = 0;
  int j = loc;
  while (a[j] == a[j + 1]) {
    cnt++;
    j++;
  }
  while (1) {
    if (upper_bound(a.begin() + loc, a.end(), a[loc] + k) != a.end()) {
      int r =
          (upper_bound(a.begin() + loc, a.end(), a[loc] + k) - a.begin()) - 1;
      if (loc == r) {
        cnt++;
        loc = r + 1;
        int j = loc;
        while (a[j] == a[j + 1]) {
          cnt++;
          j++;
        }
      } else {
        loc = r;
      }
    } else {
      if (loc == 0) cnt++;
      break;
    }
  }
  if (a[1] <= a[0] + k && a[0] != a[1]) {
    cout << cnt + 1 << endl;
  } else
    cout << cnt;
  return 0;
}
