#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define rep(i, n) for(int i = 0; i < n; i++)

int main() {
	int N, K;
	cin >> N >> K;
	vector<int> x(N);
	rep(i, N) cin >> x[i];
	vector<int> ans;
	rep(i, N) {
		if(i == 0) ans.push_back(x[i]);
		else {
			if(ans.back() + K > x[i]) continue;
			else ans.push_back(x[i]);
		}
	}
	cout << ans.size() << endl;
}