#include <bits/stdc++.h>

using namespace std;

int main() {
    int n, k;
    cin >> n >> k;
    vector <int> v(n);
    for (auto &x: v) cin >> x;
    int ans = 1;
    set <int> s;
    int leftSortedLength[n];
    leftSortedLength[0] = 1;
    for (int i = 1; i < n; i++) {
        leftSortedLength[i] = v[i] > v[i - 1] ? leftSortedLength[i - 1] + 1 : 1;
    }
    for (int i = 0; i < k; i++) s.insert(v[i]);
    bool found = leftSortedLength[k - 1] == k;
    for (int i = k; i < n; i++) {
        s.insert(v[i]);
        int mn = *s.begin(), mx = *s.rbegin();
        s.erase(v[i - k]);
        if (v[i - k] == mn && v[i] == mx) continue;
        if (leftSortedLength[i] != k)
            ans++;
        else if (!found)
            ans++, found = true;
    }
    cout << ans << "\n";
    return 0;
}
