#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << '\n'
#define debug2(x, y) debug(x), debug(y)
#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for(int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end()
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sq(x) ((x) * (x))
#define sz(x) (int)(x.size())
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
const int mxN = 5e4 + 5;

mt19937 rng((ll)std::chrono::steady_clock::now().time_since_epoch().count());

int dp[2][mxN];

void solve(){
	int n, m;
	cin >> n >> m;
	vi p(n + 1);
	repn(i, 1, n + 1) cin >> p[i];
	int ans = 0;
	memset(dp, -1, sizeof(dp));
	repn(i, 1, n + 1){
		int cr = i & 1, pr = 1 - (i & 1);
		repn(j, i + 1, n + 1){
			dp[cr][j] = 0;
			if(p[i] < p[j]){
				dp[cr][j] = 1;
				dp[cr][j] = max(dp[cr][j], dp[pr][j - 1] + 1);
			}
			if(dp[cr][j] >= m) ans++;
		}
		memset(dp[pr], -1, sizeof(dp[pr]));
	}
	cout << ans << '\n';
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	//freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
	int t = 1;
	//cin >> t;
	while(t--) solve();
	return 0;
}