#include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"

#define NDEBUG
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
using uint = unsigned int;
using usize = std::size_t;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }
template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }
template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }
template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }
template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }
template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }
template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }
template<typename T> constexpr bool btest(const T mask, const usize ind) { return ((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }
template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); }
template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
constexpr unsigned int mod                  = 1000000007;
template<typename T> constexpr T inf_v      = std::numeric_limits<T>::max() / 4;
template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};
template<typename T>
T read()
{
    T v;
    return std::cin >> v, v;
}
template<typename T>
std::vector<T> read_vec(const std::size_t size)
{
    std::vector<T> v(size);
    for (auto& e : v) { std::cin >> e; }
    return v;
}
template<typename... Types>
auto read_vals() { return std::tuple<std::decay_t<Types>...>{read<Types>()...}; }
#define SHOW(...) static_cast<void>(0)
template<typename T>
std::vector<T> make_v(const std::size_t size, T v) { return std::vector<T>(size, v); }
template<class... Args>
auto make_v(const std::size_t size, Args... args) { return std::vector<decltype(make_v(args...))>(size, make_v(args...)); }


template<typename SemiGroup>
class sparse_table
{
public:
    using semigroup_type = SemiGroup;
    using value_type     = typename semigroup_type::value_type;
    template<typename InIt>
    sparse_table(const InIt first, const InIt last) : lg{clog(static_cast<usize>(std::distance(first, last) + 1))}, table(lg, std::vector<value_type>(1 << lg))
    {
        const usize cap = 1 << lg;
        for (usize d = 0, base = 1; d < lg; d++, base <<= 1) {
            std::copy(first, last, table[d].begin());
            for (usize b = 0; b < cap / base; b++) {
                if (b % 2 == 1) {
                    for (usize i = 1; i < base; i++) { table[d][b * base + i] = semigroup_type::merge(table[d][b * base + i - 1], table[d][b * base + i]); }
                } else {
                    for (usize i = 1; i < base; i++) { table[d][(b + 1) * base - i - 1] = semigroup_type::merge(table[d][(b + 1) * base - i - 1], table[d][(b + 1) * base - i]); }
                }
            }
        }
    }
    value_type fold(const usize l, const usize r) const
    {
        assert(l < r);
        if (r - l == 1) { return table[0][l]; }
        const usize d = log2p1(r ^ l) - 1;
        return semigroup_type::merge(table[d][l], table[d][r - 1]);
    }

private:
    const usize lg;
    std::vector<std::vector<value_type>> table;
};
template<typename Value, typename Comp = std::less<Value>, typename B = uint64_t>
class linear_rmq
{
public:
    using value_type                   = Value;
    using comparator_type              = Comp;
    using bucket_type                  = B;
    static constexpr usize bucket_size = sizeof(bucket_type) * 8;
    template<typename InIt>
    linear_rmq(const InIt first, const InIt last) : sz{static_cast<usize>(std::distance(first, last))}, bucket_num{(sz + bucket_size - 1) / bucket_size}, val{first, last}, bucket_val([&]() {
                                                        std::vector<value_type> ans(bucket_num);
                                                        for (usize i = 0; i < sz; i++) { ans[i / bucket_size] = i % bucket_size == 0 ? val[i] : std::min(ans[i / bucket_size], val[i], comparator_type{}); }
                                                        return ans;
                                                    }()),
                                                    masks(sz, 0),
                                                    stable(bucket_val.begin(), bucket_val.end())
    {
        for (usize i = 0; i < bucket_num; i++) {
            std::vector<usize> g(bucket_size, sz);
            std::stack<usize> stack;
            for (usize j = 0; j < bucket_size and i * bucket_size + j < sz; j++) {
                for (; not stack.empty() and not comparator_type{}(val[stack.top()], val[i * bucket_size + j]); stack.pop()) {}
                g[j] = stack.empty() ? sz : stack.top(), stack.push(i * bucket_size + j);
            }
            for (usize j = 0; j < bucket_size and i * bucket_size + j < sz; j++) { masks[i * bucket_size + j] = g[j] == sz ? static_cast<bucket_type>(0) : (masks[g[j]] | static_cast<bucket_type>(1) << (g[j] - i * bucket_size)); }
        }
    }
    value_type fold(const usize l, const usize r) const
    {
        assert(l < r);
        const usize left_bucket = (l + bucket_size - 1) / bucket_size, right_bucket = r / bucket_size;
        if (left_bucket > right_bucket) {
            return internal(l, r);
        } else {
            return left_bucket < right_bucket
                       ? (l < bucket_size * left_bucket
                              ? (bucket_size * right_bucket < r
                                     ? std::min({stable.fold(left_bucket, right_bucket), internal(l, bucket_size * left_bucket), internal(bucket_size * right_bucket, r)}, comparator_type{})
                                     : std::min(stable.fold(left_bucket, right_bucket), internal(l, bucket_size * left_bucket), comparator_type{}))
                              : (bucket_size * right_bucket < r
                                     ? std::min(stable.fold(left_bucket, right_bucket), internal(bucket_size * right_bucket, r), comparator_type{})
                                     : stable.fold(left_bucket, right_bucket)))
                       : (l < bucket_size * left_bucket
                              ? (bucket_size * right_bucket < r
                                     ? std::min(internal(l, bucket_size * left_bucket), internal(bucket_size * right_bucket, r), comparator_type{})
                                     : internal(l, bucket_size * left_bucket))
                              : (bucket_size * right_bucket < r
                                     ? internal(bucket_size * right_bucket, r)
                                     : value_type{}));
        }
    }
    usize size() const { return sz; }

private:
    value_type internal(const usize l, usize r) const
    {
        r--;
        const B w = masks[r] >> (l % bucket_size);
        return w == 0 ? val[r] : val[l + lsbp1(w) - 1];
    }
    const usize sz, bucket_num;
    std::vector<value_type> val, bucket_val;
    std::vector<B> masks;
    struct min
    {
        using value_type = Value;
        static value_type merge(const value_type& a, const value_type& b) { return std::min(a, b, comparator_type{}); }
    };
    sparse_table<min> stable;
};

class unionfind
{
public:
    unionfind(const usize sz) : sz{sz}, rt(sz), comp_sz(sz, 1) { std::iota(rt.begin(), rt.end(), 0); }
    usize root(const usize a) { return assert(a < sz), rt[a] == a ? a : rt[a] = root(rt[a]); }
    bool same(const usize a, const usize b) { return assert(a < sz), assert(b < sz), root(a) == root(b); }
    bool unite(usize a, usize b)
    {
        assert(a < sz), assert(b < sz), a = root(a), b = root(b);
        if (a == b) { return false; }
        if (comp_sz[a] < comp_sz[b]) { std::swap(a, b); }
        return comp_sz[a] += comp_sz[b], rt[b] = a, true;
    }
    usize size() const { return sz; }
    usize size_of(const usize a) { return assert(a < sz), comp_sz[root(a)]; }
    friend std::ostream& operator<<(std::ostream& os, const unionfind& uf)
    {
        os << "[";
        for (usize i = 0; i < uf.sz; i++) { os << uf.rt[i] << (i + 1 == uf.sz ? "" : ","); }
        return (os << "]\n");
    }

private:
    const usize sz;
    std::vector<usize> rt, comp_sz;
};
int main()
{
    const auto n = read<usize>(), k = read<usize>();
    const auto p = read_vec<usize>(n);
    linear_rmq<usize> rmq(p.begin(), p.end());
    linear_rmq<usize, std::greater<usize>> rMq(p.begin(), p.end());
    std::vector<int> l(n, 0);
    for (int i = 1; i < n; i++) {
        if (p[i - 1] < p[i]) { l[i]++; }
    }
    for (int i = 1; i < n; i++) { l[i] += l[i - 1]; }
    std::vector<int> ok(n, 0);
    for (int i = 0; i + k <= n; i++) { ok[i] = l[i + k - 1] - l[i] == k - 1; }
    std::vector<int> oks;
    for (int i = 0; i < n; i++) {
        if (ok[i]) { oks.push_back(i); }
    }
    unionfind uf(n - k + 1);
    for (usize i = 0; i + k < n; i++) {
        const usize min = rmq.fold(i, i + k), max = rMq.fold(i + 1, i + 1 + k);
        if (min == p[i] and max == p[i + k]) { uf.unite(i, i + 1); }
        if (ok[i]) {
            auto l = std::lower_bound(oks.begin(), oks.end(), i + k);
            if (l == oks.end()) { continue; }
            uf.unite(i, *l);
        }
    }
    std::set<int> s;
    for (int i = 0; i <= n - k; i++) { s.insert(uf.root(i)); }
    std::cout << s.size() << std::endl;
    return 0;
}


Measured memory_bytes: 22912