#include <bits/stdc++.h>
using namespace std;
#define N 50000
// #define N 5
using ll = long long;
int main() {
    int n, m;
    cin >> n >> m;
    vector<int> p(n), q(n);
    for (int i = 0; i < n; i++) {
        cin >> p[i];
        p[i]--;
        q[p[i]] = i;  
    }
    vector<bitset<N>> c(n), pre(n + 1), suf(n);
    bitset<N> u;
    for (int i = 0; i < n; i++) u.set(i);
    for (int i = 0; i < n; i++) {
        u.set(q[i], false);
        c[q[i]] = u;
    }
    // for (int i = 0; i < n; i++) cout << c[i] << endl;
       
    for (int i = 1; i < n; i++) c[i] = c[i] >> i;
    for (int i = 0; i < n; i ++) {
        if (i % m == 0) suf[i] = c[i];
        else suf[i] = suf[i - 1] & c[i];
    }
    u = 0;
    for (int i = n - 1; i >= 0; i--) {
        if (i % m == 0) pre[i] = c[i];
        else pre[i] = pre[i + 1] & c[i];
    }
    
    ll ret = 0;
    
    for (int i = 0; i + m <= n; i++) {
        u = pre[i] & suf[i + m - 1];
        ret += u.count();
    }
    
    cout << ret << endl;
    
    return 0;
}