#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
void dbg_out() { cerr << endl; }
template <typename H, typename... T>
void dbg_out(H h, T... t) { cerr << ' ' << h; dbg_out(t...); }
#define dbg(...) { cerr << #__VA_ARGS__ << ':'; dbg_out(__VA_ARGS__); }
using ll = long long;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

const int MAXN = 2e5 + 5;
const int MOD = 1e9+7; //998244353;
const int INF = 0x3f3f3f3f;
const ll INF64 = ll(4e18) + 5;

void solve(){
	int n;
	cin >> n;
	int m;
	cin >> m;
	vector<int> a(n);
	//ainda nao uso que é uma permutacao, que caraio
	for(int i = 0; i < n; i++){
		cin >> a[i];
	}
	int ans = 0;
	vector<int> dp(n+1);
	//o problema dessa dp eh que eu movo e zero ao mesmo tempo
	for(int i = n-2; i >= 0; i--){
		for(int j = i+1; j < n; j++){
			if(a[i] < a[j]){
				dp[j] = dp[j+1]+1;
			}else{
				dp[j] = 0;
			}
			if(dp[j] >= m){
				ans++;
			}
		}
	}
	cout << ans << '\n';
}

signed main(){

    ios::sync_with_stdio(false); cin.tie(NULL);

    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }

    return 0;
}

/*
Makefile:
CXXFLAGS=-Wall -Wextra -Wshadow -g -pedantic -fsanitize=address,undefined -D_GLIBCXX_DEBUG -D_GLIBCXX_DEBUGPEDANTIC -std=gnu++17
*/