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;
int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(nullptr);
  std::cout.tie(nullptr);
  long n, K;
  cin >> n >> K;
  vector<long> v;
  vector<bool> a(n, 1);
  long mi{}, ma{};
  for (auto i{0ull}; i < n; ++i) {
    long x{};
    cin >> x;
    if (!i) mi = ma = x;
    v.insert(lower_bound(v.begin(), v.end(), x), x);
  }
  if (!(ma > mi && ma <= mi + K)) {
    cout << n;
    return 0;
  }
  for (auto i{1ull}; i < n; ++i)
    for (auto j{0ull}; j < i; ++j)
      if (a[j] && v[i] > v[j] && v[i] <= v[j] + K) a[j] = 0;
  cout << accumulate(a.begin(), a.end(), 0);
  return 0;
}
