#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(),v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define oo (ll)1e18
#define INF (ll)1e9
#define MOD (ll)(998244353)
using namespace std;
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;}
template<class T1, class T2>
void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}
template<class T1, class T2>
void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}
template<class T>
void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}
void solve(){
int n; cin >> n;
int k; cin >> k;
vector<int> a(n + 3, 0);
for(int i=1; i<=n; i++){
cin >> a[i];
}
vector<int> rnk(n + 3, 0);
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++){
if(a[i] > a[j]) rnk[i]++;
}
}
vector<int> dp(n + 3, 0);
int ans = 0;
for(int i=1; i<=n; i++){
dp[i] = 1;
for(int j=1; j<i; j++){
if(rnk[i] / k >= rnk[j] / k){
maximize(dp[i], dp[j] + 1);
}
}
maximize(ans, dp[i]);
}
cout << n - ans << '\n';
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
// freopen("flowers.inp", "r", stdin);
// freopen("flowers.out", "w", stdout);
int nTest = 1;
// cin >> nTest;
while(nTest--)
solve();
return 0;
}
