#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 count = 0;
for(int i = 0; i < N; i++) {
if(a[i] > prev + M) {
count++;
prev = prev + M;
}
else {
prev = a[i];
}
}
cout << count << endl;
return 0;
}
