#include <bits/stdc++.h>
using namespace std;
long long MAX = 10e10;
long long binpow(long long a, long long b, long long m = 1073741824) {
  a %= m;
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a % m;
    a = (a * a) % m;
    b >>= 1;
  }
  return res;
}
int factmod(int n, int p = 1073741824) {
  int res = 1;
  while (n > 1) {
    res = (res * ((n / p) % 2 ? p - 1 : 1)) % p;
    for (int i = 2; i <= n % p; ++i) res = (res * i) % p;
    n /= p;
  }
  return res % p;
}
int main() {
  ios::sync_with_stdio(NULL);
  cin.tie(NULL);
  long long n, x;
  cin >> n >> x;
  long long ans = 1;
  vector<long long> a(n);
  for (auto &c : a) cin >> c;
  for (long long i = 1; i < n; i++) {
    ans++;
    if (a[i] - a[i - 1] > x) ans = 1;
  }
  cout << ans;
  return 0;
}
