#define _CRT_SECURE_NO_WARNINGS
#include <unordered_map>
#include <unordered_set>
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pl pair<ll, ll>
#define vi vector<ll>
#define vii vector<vi>
#define vc vector<char>
#define vcc vector<vc>
#define vp vector<pl>
#define mi map<ll,ll>
#define mc map<char,int>
#define sortx(X) sort(X.begin(),X.end());
#define all(X) X.begin(),X.end()
#define allr(X) X.rbegin(),X.rend()
#define ln '\n'
#define YES {cout << "YES\n"; return;}
#define NO {cout << "NO\n"; return;}
#define MUN {cout << "-1\n"; return;}
const int MODE = 999999893;
using namespace std;
void solve(int tc) {
ll n, k;
cin >> n >> k;
vi X;
for (int i = 0; i < n; i++)
{
ll a; cin >> a;
a = (i + 1) * k - a;
if (a >= 0) X.push_back(a);
}
vi Z;
for (int i = 0; i < X.size(); i++)
{
ll ind = upper_bound(all(Z), X[i]) - Z.begin();
if (ind == Z.size()) Z.push_back(X[i]);
else Z[ind] = X[i];
}
cout << n - Z.size();
}
int main()
{
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
int size = 1;
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
// cin >> size;
for (int i = 1; i <= size; i++)
solve(i);
}
