#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}

template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

struct Init{
  Init(){
    cin.tie(0);
    ios::sync_with_stdio(false);
  }
}init;

class UnionFind{
  vector<int> parent, depth, size;
  int count;
public:
  UnionFind(int n): parent(n), depth(n,1), size(n,1), count(n){
    iota(ALL(parent),0);
  }
  int get_root(int i){
    if(parent[i] == i) return i;
    else return parent[i] = get_root(parent[i]);
  }
  bool is_same(int i, int j){return get_root(i) == get_root(j);}
  int merge(int i, int j){
    int ri = get_root(i), rj = get_root(j);
    if(ri == rj) return ri;
    else{
      --count;
      if(depth[ri] < depth[rj]){
        parent[ri] = rj;
        size[rj] += size[ri];
        return rj;
      }else{
        parent[rj] = ri;
        size[ri] += size[rj];
        if(depth[ri] == depth[rj]) ++depth[ri];
        return ri;
      }
    }
  }
  int get_size(int i){return size[get_root(i)];}
  int count_group(){return count;}
};


template <typename T> vector<pair<T,T>> sliding_minmax(const vector<T> &a, int k){
  int n = a.size();
  deque<int> dq_min, dq_max;
  vector<pair<T,T>> ret;

  REP(i,k){
    while(not dq_min.empty() and a[dq_min.back()] >= a[i]){
      dq_min.pop_back();
    }
    
    dq_min.push_back(i);

    while(not dq_max.empty() and a[dq_max.back()] <= a[i]){
      dq_max.pop_back();
    }
    
    dq_max.push_back(i);
  }

  REP(i,n-k+1){
    while(dq_min.front() < i){
      dq_min.pop_front();
    }

    while(dq_max.front() < i){
      dq_max.pop_front();
    }

    ret.push_back(make_pair(a[dq_min.front()], a[dq_max.front()]));

    while(not dq_min.empty() and i+k < n and a[dq_min.back()] >= a[i+k]){
      dq_min.pop_back();
    }

    while(not dq_max.empty() and i+k < n and a[dq_max.back()] <= a[i+k]){
      dq_max.pop_back();
    }
    
    dq_min.push_back(i+k);
    dq_max.push_back(i+k);
  }
  
  return ret;
}




int main(){
  int n,k;
  while(cin >> n >> k){
    vector<int> p(n); cin >> p;

    if(n == k){
      cout << 1 << endl;
      continue;
    }
    
    UnionFind uf(n-k+1);

    auto minmax = sliding_minmax(p,k+1);

    
    REP(i,n-k){
      if(minmax[i].fst == p[i] and minmax[i].snd == p[i+k]){
        uf.merge(i,i+1);
      }
    }

    vector<int> b(n);
    REP(i,n-1) b[i] = p[i+1] - p[i] >= 0 ? 1 : 0;

    vector<int> c(n);
    REP(i,n-1) c[i+1] = c[i] + b[i];

    vector<int> inc;
    REP(i,n-k+1){
      if(c[i+k-1]-c[i] == k-1){
        inc.push_back(i);
      }
    }

    REP(i,(int)inc.size()-1){
      uf.merge(inc[i], inc[i+1]);
    }

    int ans = uf.count_group();
    cout << ans << endl;
  }
  
  return 0;
}


Measured memory_bytes: 8304