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 power(long long x, long long y, long long mod) {
  long long res = 1;
  while (y > 0) {
    if (y % 2 == 1) {
      res *= x;
    }
    y /= 2;
    x *= x;
  }
  return res;
}
long long solve() {
  long long n, k;
  cin >> n >> k;
  vector<long long> v(n);
  for (long long i = 0; i < n; i++) cin >> v[i];
  ;
  sort((v).begin(), (v).end());
  for (long long i = 1; i < n; i++) {
    for (long long j = 0; j < i; j++) {
      if ((v[j] + k) >= v[i]) {
        v[j] = LONG_MIN;
      }
    }
  }
  long long count = 0;
  for (long long i = 0; i < n; i++) {
    if (v[i] > 0) count++;
  }
  cout << count << endl;
  return 0;
}
int main() {
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(0);
  ;
  solve();
}
