#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll n, k, now, ans = 1;
  cin >> n >> k >> now;
  rep(i, n - 1) {
    ll x;
    cin >> x;
    if (k <= x - now) {
      now = x;
      ans += 1;
    }
  }
  cout << ans << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}