#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T> using treap = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define REP(i, n) for (long long i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (long long i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) begin(obj), end(obj)
#define RALL(obj) rbegin(obj), rend(obj)
#define fi first
#define se second
using ii = pair<int, int>;
vector<ii> dirs = {
    {1, 0}, {0, 1}, {-1, 0}, {0, -1},  // 4方向
    {1, 1}, {-1, 1}, {-1, -1}, {1, -1},  // 斜め
    {0, 0},  // 自身
};
template <class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }
template <class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
template <class T, class S> vector<T> make_vec(size_t n, S x) { return vector<T>(n, x); }
template <class T, class... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec<T>(ts...))>(n, make_vec<T>(ts...)); }

// debug
template <class T> ostream& operator<<(ostream& s, vector<T>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : " "); return s; }
template <class T> ostream& operator<<(ostream& s, vector<vector<T>>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : "\n"); return s; }
template <class T, class S> ostream& operator<<(ostream& s, pair<T, S>& p) { s << "{" << p.first << ", " << p.second << "}"; return s; }
template <class T> ostream& operator<<(ostream& s, set<T> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
template <class T> ostream& operator<<(ostream& s, multiset<T> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
template <class T, class S> ostream& operator<<(ostream& s, map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
template <class T, class S> ostream& operator<<(ostream& s, unordered_map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
#ifdef _MY_DEBUG
    #define dump(...) cerr << "/* " << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << endl, dump_func(__VA_ARGS__), cerr << "*/\n\n";
#else
    #define dump(...)
    #define endl "\n"
#endif
void dump_func() { cerr << endl; }
template <class Head, class... Tail> void dump_func(Head&& h, Tail&&... t) { cerr << h << (sizeof...(Tail) == 0 ? "" : ", "), dump_func(forward<Tail>(t)...); }

struct Fast { Fast() { cin.tie(nullptr); ios::sync_with_stdio(false); } } fast;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
constexpr int MOD = 1000000007;
// *************** TEMPLATE END *************** 

template <class T = int>
class SegTree {
    using VT = vector<T>;
    int orig_n;
    // k番目のノードの[l, r)について[a, b)を求める
    T query(int a, int b, int k, int l, int r) {
        if (r <= a || b <= l) {
            return UNIT;
        }
        if (a <= l && r <= b) {
            return dat[k];
        }
        T vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
        T vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
        return f(vl, vr);
    }

public:
    int N;
    VT dat;
    function<T(T, T)> f;
    T UNIT;
    SegTree() {}
    SegTree(int n, function<T(T, T)> f_, const T unit) : orig_n(n), f(f_), UNIT(unit) {
        for (N = 1; N < n; N *= 2)
            ;
        dat = VT(2 * N - 1, UNIT);
    }
    SegTree(
        const VT& a, function<T(T, T)> f_ = [](int a, int b) { return min(a, b); }, T unit = 1e15)
        : orig_n(a.size()), f(f_), UNIT(unit) {
        for (N = 1; N < orig_n; N *= 2)
            ;
        dat = VT(2 * N - 1);
        REP(i, a.size()) { dat[N - 1 + i] = a[i]; }
        for (int k = N - 2; k >= 0; k--) {
            dat[k] = f(dat[2 * k + 1], dat[2 * k + 2]);
        }
    }
    // k番目をaに
    void update(int k, T a) {
        k += N - 1;
        dat[k] = a;
        while (k > 0) {
            k = (k - 1) / 2;
            dat[k] = f(dat[2 * k + 1], dat[2 * k + 2]);
        }
    }
    // [a, b)でのクエリ
    T query(int a, int b) {
        assert(0 <= a && a < b && b <= orig_n);
        return query(a, b, 0, 0, N);
    }
    T query(int a) { return query(a, a + 1); }
};

signed main() {
    int n, K; cin >> n >> K;
    vector<int> a(n); REP (i, n) cin >> a[i];
    SegTree<int> smi(a, [](int x, int y) { return min(x, y); }, 1e15);
    SegTree<int> sma(a, [](int x, int y) { return max(x, y); }, -1);
    vector<bool> sorted(n);
    vector<int> idx(n);
    REP (i, n) idx[a[i]] = i;
    vector<int> rs(n), ls(n);
    {
        set<int> s = {-1, n};
        REP (i, n) {
            rs[idx[i]] = *s.lower_bound(idx[i]);
            s.insert(idx[i]);
        }
    }
    {
        set<int> s = {-n, 1};
        for (int i = n - 1; i >= 0; i--) {
            ls[idx[i]] = -*s.lower_bound(-idx[i]);
            s.insert(-idx[i]);
        }
    }
    dump(ls, rs);
    vector<int> ng(n + 1);
    REP (i, n) {
        int l = n, r = -1;
        if (ls[i] != -1 && i - ls[i] + 1 <= K) {
            chmin(l, max(0LL, i - K + 1));
            chmax(r, min(n - 1, ls[i]));
            dump(l, r);
        }
        if (rs[i] != n && rs[i] - i + 1 <= K) {
            dump(rs[i], K);
            chmin(l, max(0LL, rs[i] - K + 1));
            chmax(r, min(n - 1, i));
            dump(l, r);
        }
        dump(i, l, r);
        if (l <= r) {
            ng[l]++;
            ng[r + 1]--;
        }
    }
    REP (i, n) ng[i + 1] += ng[i];
    dump(ng);

    int adi = ng[0] == 0;
    int ans = !adi;
    dump(adi, ans);
    REP (i, n) {
        if (i + K >= n) break;
        int mi = smi.query(i + 1, i + K);
        int ma = sma.query(i + 1, i + K);
        if (ng[i + 1] == 0) {
            adi++;
        } else if (a[i] > mi || a[i + K] < ma) {
            dump(i);
            ans++;
        }
    }
    dump(ans, adi);
    cout << ans + min(1LL, adi) << endl;
}


Measured memory_bytes: 24192