#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define FOR(i,k,n) for(int(i)=(k);(i)<(n);++(i))
#define rep(i,n) FOR(i,0,n)
#define all(v) begin(v),end(v)
#define debug(x) std::cerr<<#x<<": "<<x<<"\n"
#define debug2(x,y) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<"\n"
#define debug3(x,y,z) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<", "<<#z<<": "<<z<<"\n"

using ll=long long;
using vi=std::vector<int>;
using vvi=std::vector<vi>;
using vll=std::vector<ll>;
using vvll=std::vector<vll>;
template<typename T> using vvec=std::vector<std::vector<T>>;
template<typename T>
auto make_v(size_t sz){return std::vector<T>(sz);}
template<typename T,typename... Ts>
auto make_v(size_t sz,Ts...ts){return std::vector<decltype(make_v<T>(ts...))>(sz,make_v<T>(ts...));}
template<typename T>
void fill_v(T&var,const T&x){var=x;}
template<typename V,typename T>
void fill_v(V&v,const T&x){for(auto&& w:v){fill_v(w,x);}}

template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<std::vector<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<std::deque<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s, const std::set<T>&v){
  s<<"\n";for(auto&& elm:v){s<<elm<<"\t";}s<<"\n";return s;}

inline void scan(int&a){scanf("%d",&a);}
inline void scan(ll&a){scanf("%lld",&a);}
inline void scan(char&a){scanf(" %c",&a);}
inline void scan(double&a){scanf("%lf",&a);}
inline void scan(std::string&s){char BUF[3000000];scanf(" %s",BUF);s=std::string(BUF);}
template<typename T>
inline void scan(std::vector<T>&v){for(auto&& sv:v){scan(sv);}}
template<typename First,typename...Args>
inline void scan(First&f,Args&...args){scan(f);scan(args...);}
inline void print(int a){printf("%d\n",a);}
inline void print(ll a){printf("%lld\n",a);}
inline void print(double a){printf("%.12f\n",a);}
inline void print(std::string s){std::cout<<s<<"\n";}

struct RmQ {
  using T = int; // type or class of monoid
  static T operate(const T& left, const T& right) {
    return left > right ? right : left; // definition of operator
  }
  static constexpr T identity() { return 9999999; }
};

struct RMQ {
  using T = int; // type or class of monoid
  static T operate(const T& left, const T& right) {
    return left < right ? right : left; // definition of operator
  }
  static constexpr T identity() { return -1; }
};

template<class Monoid>
class SegTree {
private:
  using T = typename Monoid::T;
  const int n;
  std::vector<T> t;

  void propagate_to(int i) { t[i] = Monoid::operate(t[2*i], t[2*i+1]); }

public:
  SegTree(int n_) : n(n_), t(2*n, Monoid::identity()) {}
  SegTree(const std::vector<T>& v) : n(v.size()), t(2*n) {
    copy(begin(v), end(v), begin(t) + n);
    for (int i = n-1; i > 0; --i) { propagate_to(i); }
  }
  template<class Itr>
  SegTree(Itr first, Itr last) : n(std::distance(first, last)), t(2*n) {
    copy(first, last, begin(t) + n);
    for (int i = n-1; i > 0; --i) { propagate_to(i); }
  }

  void set(int i, const T& x) {
    t[i += n] = x;
    while (i >>= 1) { propagate_to(i); }
  }

  T get(int i) { return t[i + n]; }

  T accumulate(int l, int r) {
    T accl = Monoid::identity(), accr = Monoid::identity();
    for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
      if (l & 1) { accl = Monoid::operate(accl, t[l++]); }
      if (r & 1) { accr = Monoid::operate(t[r-1], accr); }
    }
    return Monoid::operate(accl, accr);
  }
};

using namespace std;

class UF {
private:
  vector<int> data; // parent or size
  void init(int n) {
    data.assign(n, -1);
  }

public:
  UF() {}
  UF(int n) {
    init(n);
  }
  int root(int x) {
    if (data[x] < 0) return x;
    return data[x] = root(data[x]);
  }
  bool unite(int x, int y) {
    x = root(x);
    y = root(y);
    if (x == y) return false;
    if (data[x] > data[y]) swap(x, y); // data[x] and data[y] are negative.
    data[x] += data[y];
    data[y] = x;
    return true;
  }
  int size(int x) {
    return -data[root(x)];
  }
  bool same(int x, int y) {
    return root(x) == root(y);
  }
  int get_data(int i) {
    return data[i];
  }
};

int main() {
  int n, k;
  scan(n, k);
  vi p(n);
  scan(p);
  if (n == k) {
    print(1);
    return 0;
  }

  p.push_back(-1);
  auto segt_min = SegTree<RmQ>(p);
  auto segt_max = SegTree<RMQ>(p);

  vi mono_incr(n + 1, n);
  int base = 0;
  FOR (i, 1, n) {
    if (p[i - 1] < p[i]) {
      continue;
    } else {
      FOR (j, base, i) {
        mono_incr[j] = i;
      }
      base = i;
    }
  }

  vi mo_in(n - k + 1, 0);
  vi renketsu(n - k + 1, 0);
  rep (i, n - k + 1) {
    int j = i + k;
    if (mono_incr[i] >= j) {
      mo_in[i] = 1;
    }
    int mid_min = segt_min.accumulate(i + 1, j);
    int mid_max = segt_max.accumulate(i + 1, j);
    if (p[i] < mid_min && mid_max < p[j]) {
      renketsu[i] = 1;
    }
  }

  auto uf = UF(n - k + 2);
  rep (i, n - k + 1) {
    if (renketsu[i] == 1) {
      uf.unite(i, i + 1);

    }
    if (mo_in[i]) {
      uf.unite(i, n - k + 1);

    }
  }

  int ans = 0;
  rep (i, n - k + 2) {
    if (uf.get_data(i) < 0) {
      ans += 1;
    }
  }
  if (uf.size(n - k + 1) == 1) {
    ans -= 1;
  }

  print(ans);

  return 0;
}


Measured memory_bytes: 7280