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

const int MAXN = 5000;
bitset<MAXN> B[MAXN];

int main()
{
    int n, m;
    cin >> n >> m;
    vector<int> p(n);

    // 输入排列 p
    for (int i = 0; i < n; ++i)
    {
        cin >> p[i];
    }

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

    // 计数符合条件的子数组对
    int result = 0;

    for (int i = 0; i <= n - m; ++i)
    {
        for (int j = i + m; j <= n - m; ++j)
        {
            // 比较区间 [i, i+m) 和 [j, j+m) 是否逐个小于
            bool isValid = true;
            for (int k = 0; k < m; ++k)
            {
                if (p[i + k] >= p[j + k])
                {
                    isValid = false;
                    break;
                }
            }
            if (isValid)
            {
                result++;
            }
        }
    }

    cout << result << endl;
    return 0;
}