#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; long long n, m, arr[N]; vector<int> bad; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> arr[i]; } for (int i = 1; i <= n; i++) { if (i * m >= arr[i]) { auto it = upper_bound(bad.begin(), bad.end(), i * m - arr[i]); if (it == bad.end()) bad.push_back(i * m - arr[i]); else *it = i * m - arr[i]; } } cout << n - bad.size() << '\n'; return 0; }