#include <iostream>
#include <vector>
#include <bitset>
using namespace std;

const int MAXN = 50000;
bitset<MAXN> bits[MAXN];  // 用于存储布尔矩阵

int main() {
    int n, m;
    cin >> n >> m;
    vector<int> p(n);
    for (int i = 0; i < n; ++i) {
        cin >> p[i];
    }

    // 构建布尔矩阵 C[l,s]
    for (int l = 0; l < n; ++l) {
        for (int s = 1; l + s < n; ++s) {
            if (p[l] < p[l + s]) {
                bits[l][s] = 1;
            }
        }
    }

    int count = 0;

    // 选择步长为 m 的枢轴元素，进行前缀和后缀 OR 操作
    for (int i = 0; i + m < n; ++i) {
        for (int j = i + m; j + m <= n; ++j) {
            // 通过位集快速计算前缀和后缀 OR 结果
            if ((bits[i] & bits[j]).count() == m) {
                count++;
            }
        }
    }

    cout << count << endl;
    return 0;
}