#include <iostream>
#include <string>
#include <cmath>
#include <vector>
#include <stack>
#include <set>
#include <array>
#include <deque>
#include <queue>
#include <cstdio>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <utility>
#include <climits>
#include <iomanip>
#define ll long long
#define endl '\n'
#define fast ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<long long> a(n);
for(int i = 0; i < n; i++)
cin >> a[i];
long long prev = 0;
int cnt = 0;
for(int i = 0; i < n; i++) {
if(a[i] - prev > m) {
cnt++;
prev = prev + m;
}
else {
prev = a[i];
}
}
cout << cnt << endl;
return 0;
}
