#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define F first
#define S second
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

int a[10];
int r[10];
bitset<10> g[10];
bitset<10> ands[10];

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    int n,k;cin>>n>>k;
    rep(i,0,n)cin>>a[i];
    rep(i,0,n)--a[i];
    rep(i,0,n)r[a[i]]=i;
    for(int i = n-2; i >= 0; i--){
        g[r[i]]=g[r[i+1]];
        g[r[i]][r[i+1]]=1;
    }
    rep(i,1,n)g[i]>>=i;

    ll ans = 0;
    bitset<10> window;
    for (int thresh = k-1; thresh < n; thresh += k) {
        ands[thresh] = g[thresh];
        for (int i = thresh-1; i > thresh-k; i--) {
            ands[i] = ands[i+1] & g[i];
        }
        window = g[thresh];
        for (int j = thresh-k+1; j <= min(thresh, n-k); j++) {
            window = window & g[j+k-1];
            ans += (window & ands[j]).count();
        }
    }
    cout<<ans<<'\n';
}