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

#define fs first
#define sc second

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }


// std::vector Declaration
template<typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

// std::vector Initialization
template<typename T>
void fill_all(T& arr, const T& v) { arr = v; }
template<typename T, typename U>
void fill_all(T& arr, const U& v) { for (auto& i : arr) fill_all(i, v); }

// std::vector Debug
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::deque Debug
template<typename T>
ostream& operator<<(ostream& os, const deque<T>& d) {
    os << "[";
    bool a = 1;
    for (auto e : d) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::pair Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << " " << p.second << ")";
    return os;
}

// std::set Debug
template<typename T>
ostream& operator<<(ostream& os, const set<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::multiset Debug
template<typename T>
ostream& operator<<(ostream& os, const multiset<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::map Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& mp) {
    os << "{";
    bool a = 1;
    for (auto e : mp) {
        os << (a ? "" : " ");
        os << e.first << ":" << e.second;
        a = 0;
    }
    os << "}";
    return os;
}

// std::tuple Debug
template<int N, class Tuple>
void out(ostream& os, const Tuple& t){}
template<int N, class Tuple, class H, class ...Ts>
void out(ostream& os, const Tuple& t) {
    if (N) os << " ";
    os << get<N>(t);
    out<N+1,Tuple,Ts...>(os, t);
}
template<class ...Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
    os << "(";
    out<0,tuple<Ts...>,Ts...>(os, t);
    os << ")";
    return os;
}

// Debug
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl


struct edge { int to, cost; };
ostream& operator<<(ostream& os, const edge& e) {
    os << "(" << e.to << ", " << e.cost << ")";
    return os;
}

const LL LINF = 1LL<<60;
const int IINF = 1<<30;
const LL MOD = 1e9+7;

template<typename Monoid>
struct SegmentTree {
    using F = function<Monoid(Monoid,Monoid)>;
    int sz;
    vector< Monoid > data;
    const F f;
    const Monoid M1;
    SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1) {
        sz = 1;
        while(sz < n) sz <<= 1;
        data.assign(2 * sz, M1);
    }
    void set(int k, const Monoid &x) {
        data[k + sz] = x;
    }
    void build() {
        for(int k = sz - 1; k > 0; --k) {
            data[k] = f(data[2 * k + 0], data[2 * k + 1]);
        }
    }
    void update(int k, const Monoid &x) {
        k += sz;
        data[k] = x;
        while(k >>= 1) {
            data[k] = f(data[2 * k + 0], data[2 * k + 1]);
        }
    }
    void add(int k, const Monoid &x) {
        update(k, data[k+sz] + x);
    }
    Monoid query(int a, int b, int k, int l, int r) {
        if (r <= a || b <= l) {
            return M1;
        } else if (a <= l && r <= b) {
            return data[k];
        } else {
            return f(query(a, b, 2 * k + 0, l, (l + r) / 2),
                    query(a, b, 2 * k + 1, (l + r) / 2, r));
        }
    }
    Monoid query(int a, int b) {
        // return f[a, b).
        return query(a, b, 1, 0, sz);
    }
};


int main()
{
    int N, K;
    cin >> N >> K;
    vector<int> P(N);
    for (int i = 0; i < N; ++i) {
        cin >> P[i];
    }

    auto mi = SegmentTree<int>(N, [](int a, int b){return min(a,b);}, IINF);
    for (int i = 0; i < N; ++i) {
        mi.set(i, P[i]);
    }
    mi.build();

    auto ma = SegmentTree<int>(N, [](int a, int b){return max(a,b);}, -IINF);
    for (int i = 0; i < N; ++i) {
        ma.set(i, P[i]);
    }
    ma.build();


    vector<int> b(N, 0);
    for (int i = 0; i < N-1; ++i) {
        b[i+1] = b[i] + (P[i] < P[i+1]);
    }

    int sum = N-K+1;
    for (int i = 0; i < N-K; ++i) {
        if (mi.query(i, i+K) == P[i] &&
            ma.query(i+1, i+K+1) == P[i+K] &&
            b[i+K-1] - b[i] != K-1 &&
            b[i+K] - b[i+1] != K-1) {
            --sum;
        }
    }


    int cnt = 0;
    for (int i = 0; i <= N-K; ++i) {
        if (b[i+K-1] - b[i] == K-1) {
            ++cnt;
        }
    }

    sum -= max(cnt - 1, 0);

    cout << sum << endl;

    return 0;
}


Measured memory_bytes: 6016