// brute f0rce spammer
#include<bits/stdc++.h>
using namespace std;
typedef pair<long long,long long> pii;
#define int long long
#define el cout << '\n'
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
#define debug(f,n) for (int i = 0; i < n; i++){cout << f[i] << " ";} el;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FOD(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define maxn 4003
#define mod 998244353
template <class T1, class T2>bool maximize(T1 &a, T2 b){if (a < b) {a = b; return true;}return false;}
template <class T1, class T2>bool minimize(T1 &a, T2 b){if (a > b) {a = b; return true;}return false;}
vector<vector<bool>> vis;
vector<vector<char>> x;
int minr, maxr, minc, maxc, cnt;
int m, n;
void solve(){
int n, k;
cin >> n >> k;
vector<int> x(n);
REP(i, n) cin >> x[i];
int cnt = 0, now = 0;
REP(i, n){
if (now + k < x[i]){
x[i] = now + k;
cnt++;
}
now = x[i];
}
cout << cnt;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int q = 1;
//cin >> q;
while(q--){
solve();
el;
}
return 0;
}
