#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 110;
int a[N], b[N], last[N];
int n, k;
bool check(int a[], int b[])
{
for(int i = 0; i < n; i ++)
if(a[i] != b[i]) return false;
return true;
}
int main()
{
cin >> n >> k;
for(int i=0;i<n;i++)cin>>a[i];
memcpy(last, a, sizeof a);
int sum = 0;
for(int i = 0; i <= n - k; i ++){
memcpy(b, a, sizeof a);
sort(b + i, b + i + k);
if(!check(last, b)) sum ++;
memcpy(last, b, sizeof b);
}
cout << sum << endl;
return 0;
}