#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long



#if 0
const int MOD = ;

inline int lgput(int a, int b) {
    int ans = 1;
    while(b > 0) {
        if(b & 1) ans = (1LL * ans * a) % MOD;
        b >>= 1;
        a = (1LL * a * a) % MOD;
    }
    return ans;
}

inline void mod(int &x) {
    if(x >= MOD)
        x -= MOD;
}

inline void add(int &x, int y) {
    x += y;
    mod(x);
}

inline void sub(int &x, int y) {
    x += MOD - y;
    mod(x);
}

inline void mul(int &x, int y) {
    x = (1LL * x * y) % MOD;
}

inline int inv(int x) {
    return lgput(x, MOD - 2);
}
#endif

#if 0
int fact[], invfact[];

inline void prec(int n) {
    fact[0] = 1;
    for(int i = 1; i <= n; i++) {
        fact[i] = (1LL * fact[i - 1] * i) % MOD;
    }
    invfact[n] = lgput(fact[n], MOD - 2);
    for(int i = n - 1; i >= 0; i--) {
        invfact[i] = (1LL * invfact[i + 1] * (i + 1)) % MOD;
    }
}

inline int comb(int n, int k) {
    if(n < k) return 0;
    return (1LL * fact[n] * (1LL * invfact[k] * invfact[n - k] % MOD)) % MOD;
}
#endif

using namespace std;

const int INF = 1e9;
const int MAXN = (int) 2e5;

pair <int, int> aint[4 * MAXN + 1];

inline void combine(pair <int, int> &a, pair <int, int> b) {
    a.first = min(a.first, b.first);
    a.second = max(a.second, b.second);
}

void update(int nod, int left, int right, int pos, int val) {
    if(left == right) {
        aint[nod] = {val, val};
    }
    else {
        int mid = (left + right) / 2;
        if(pos <= mid) update(2 * nod, left, mid, pos, val);
        else update(2 * nod + 1, mid + 1, right, pos, val);
        combine(aint[nod], aint[2 * nod]);
        combine(aint[nod], aint[2 * nod + 1]);
    }
}

pair <int, int> query(int nod, int left, int right, int l, int r) {
    if(l <= left && right <= r) {
        //cerr << l << " " << left << " " << right << " " << r << " " << aint[nod].first << " " << aint[nod].second << "\n";
        return aint[nod];
    }
    else {
        int mid = (left + right) / 2;
        pair <int, int> ans = {INF, -INF};
        if(l <= mid) combine(ans, query(2 * nod, left, mid, l, r));
        if(mid < r) combine(ans, query(2 * nod + 1, mid + 1, right, l, r));
        return ans;
    }
}


int main() {
#if 0
    ifstream cin("A.in");
    ofstream cout("A.out");
#endif
    int i, n, k;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    cin >> n >> k;

    for(i = 1; i <= 4 * n; i++) {
        aint[i] = {INF, -INF};
    }

    vector <int> a(n + 1), len(n + 1);
    for(i = 1; i <= n; i++) {
        cin >> a[i];
        update(1, 1, n, i, a[i]);
        if(a[i] > a[i - 1]) {
            len[i] = 1 + len[i - 1];
        }
        else {
            len[i] = 1;
        }
    }

    vector <bool> bad(n + 1);
    int ans = n - k + 1, cnt = 0;

    for(i = k; i <= n; i++) {
        if(len[i] >= k) {
            cnt++;
            if(cnt > 1) {
                bad[i] = 1;
                ans--;
            }
        }
    }

    for(i = 1; i + k <= n; i++) {
        auto cur = query(1, 1, n, i + 1, i + k - 1);
        //cerr << a[i] << " " << cur.first << " " << cur.second << " " << a[i + k] << "\n" ;
        if(bad[i + k] == 0 && a[i] < cur.first && cur.second < a[i + k]) {
            ans--;
        }
    }

    cout << ans;

    return 0;
}


Measured memory_bytes: 8064