// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
auto constexpr INF32 = numeric_limits<int32_t>::max()/2-1;
auto constexpr INF64 = numeric_limits<int64_t>::max()/2-1;
auto constexpr INF   = numeric_limits<int>::max()/2-1;
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << setw(3) << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T> constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; }
template <class T> constexpr bool chmax(T& x, T const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class F> int ppt(C const& v, F f) {
    return partition_point(v.begin(), v.end(), f)-v.begin();
}
// <<<
// >>> DST
template <class Handler>
struct DST : Handler {
    using Value = typename Handler::Value;
    using Handler::unit; // () -> Value
    using Handler::merge; // (Value,Value) -> Value
    static constexpr int msb(int x) { return x ? 31-__builtin_clz(x) : -1; }

    vector<vector<Value>> v;
    DST(vector<Value> const& dat = {}) : v({dat}) { build(); }
    void build() {
        assert(v.size());
        if (v[0].empty()) return;
        v.resize(1);
        if (v[0].size() <= 1u) return;
        int n = v[0].size(), lg = __lg(2*n-1);
        v.resize(lg, vector<Value>(n,unit()));
        for (int h = 1; h < lg; ++h) {
            const int w = 1<<h;
            for (int b = w; b < n; b += (w<<1)) {
                Value x = unit();
                for (int j = b-1; j >= b-w; --j) {
                    v[h][j] = x = merge(v[0][j], x);
                }
                x = unit();
                for (int j = b; j < min(n,b+w); ++j) {
                    v[h][j] = x = merge(x, v[0][j]);
                }
            }
        }
    }
    int size() const { return v.empty() ? 0 : v[0].size(); }
    Value get(int l, int r) const {
        assert(0 <= l); assert(l <= r); assert(r <= size());
        if (l == r) return unit();
        --r;
        if (l == r) return v[0][l];
        const int h = msb(l^r);
        return merge(v[h][l], v[h][r]);
    }
    Value operator[](int idx) const {
        assert(0 <= idx); assert(idx < size());
        return v[0][idx];
    }
};
// <<<
struct RangeMin {
    using Value = int;
    constexpr static Value unit() { return INF; }
    constexpr static Value merge(Value x, Value y) { return min(x,y); }
};
struct RangeMax {
    using Value = int;
    constexpr static Value unit() { return -INF; }
    constexpr static Value merge(Value x, Value y) { return max(x,y); }
};

int32_t main() {
    int n,k; cin >> n >> k;
    vector<int> a(n); cin >> a;

    vector<int> cnt(n);
    rep (i,n-1) cnt[i+1] = cnt[i] + (a[i] > a[i+1]);

    int f = 0, ans = 0;
    DST<RangeMin> mi(a);
    DST<RangeMax> ma(a);
    rep (i,n-k+1) {
        if (cnt[i+k-1] == cnt[i]) {
            f = 1;
            continue;
        }
        while (i+k+1 <= n
               && mi.get(i,i+k) == a[i]
               && ma.get(i+1,i+k+1) == a[i+k]) ++i;
        ans++;
    }

    cout << ans+f << endl;

}


Measured memory_bytes: 61284