#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
using namespace std;
#define MOD (long long int)(1e9+7)
#define ll long long int
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define reps(i,n) for(int i=1; i<=(int)(n); i++)
#define REP(i,n) for(int i=n-1; i>=0; i--)
#define REPS(i,n) for(int i=n; i>0; i--)
#define INF (int)(1123456789)
#define LINF (long long int)(112345678901234567)
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
#define all(v) v.begin(), v.end()

const int N = (int)3e5;

ll mpow(ll a, ll b){
  if(b==0) return 1;
  else if(b%2==0){ll memo = mpow(a,b/2); return memo*memo%MOD;}
  else return mpow(a,b-1) * a % MOD;
}
ll lpow(ll a, ll b){
  if(b==0) return 1;
  else if(b%2==0){ll memo = lpow(a,b/2); return memo*memo;}
  else return lpow(a,b-1) * a;
}
ll gcd(ll a, ll b){
  if(b==0) return a;
  else return gcd(b, a%b);
}
vector<ll> kaijo_memo;
ll kaijo(ll n){
  if(kaijo_memo.size() > n) return kaijo_memo[n];
  if(kaijo_memo.size() == 0) kaijo_memo.push_back(1);
  while(kaijo_memo.size() <= n) kaijo_memo.push_back(kaijo_memo[kaijo_memo.size()-1] * kaijo_memo.size() % MOD);
  return kaijo_memo[n];
}
vector<ll> gyaku_kaijo_memo;
ll gyaku_kaijo(ll n){
  if(gyaku_kaijo_memo.size() > n) return gyaku_kaijo_memo[n];
  if(gyaku_kaijo_memo.size() == 0) gyaku_kaijo_memo.push_back(1);
  while(gyaku_kaijo_memo.size() <= n) gyaku_kaijo_memo.push_back(gyaku_kaijo_memo[gyaku_kaijo_memo.size()-1] * mpow(gyaku_kaijo_memo.size(), MOD-2) % MOD);
  return gyaku_kaijo_memo[n];
}

ll nCr(ll n, ll r){
  if(n == r) return 1;//0個の丸と-1個の棒みたいな時に時に効く？不安.
  if(n < r || r < 0) return 0;
  ll ret = 1;
  ret *= kaijo(n); ret %= MOD;
  ret *= gyaku_kaijo(r); ret %= MOD;
  ret *= gyaku_kaijo(n-r); ret %= MOD;
  return ret;
}


int main(void){
  ll n,k;cin>>n>>k;
  vector<ll> P;
  vector<bool> L,R,sorted;
  rep(i,n){
    ll p;cin>>p;
    P.push_back(p);
    L.push_back(false);
    R.push_back(false);
    sorted.push_back(false);
  }

  int count = 0;
  int memo = -1;
  rep(i,n){
    if(memo < P[i]){
      memo = P[i];
      count++;
      if(count >= k){
        sorted[i] = true;
      }
    }else{
      count = 1;
      memo = P[i];
    }
  }

  queue<int> ql,rr;
  rep(i,n){
    int now = P[i];
    while(rr.size() > 0){
      if(rr.front() + k <= i || P[rr.front()] < now){
        rr.pop();
      }else{
        break;
      }
    }
    if(rr.empty()){
      R[i] = true;
    }
    rr.push(i);
  }
  REP(i,n){
    int now = P[i];
    while(ql.size() > 0){
      if(i + k <= ql.front() || P[ql.front()] > now){
        ql.pop();
      }else{
        break;
      }
    }
    if(ql.empty()){
      L[i] = true;
    }
    ql.push(i);
  }

  ll ans = n-k+1;
  ll kawaran = 0;
  ll kaburu = 0;
  rep(l,n){
    int r = l+k;
    if(r == n+1){
      break;
    }
    if(sorted[r-1]){
      kawaran++;
      continue;
    }
    if(l==0) continue;
    if(L[l-1] && R[r-1]){
      kaburu++;
    }
  }
  /*cerr<<ans<<" "<<kawaran<<" "<<kaburu<<endl;
  rep(i,L.size()){
    cerr<<L[i]<<" "<<R[i]<<endl;
  }*/
  ans -= max((ll)0, kawaran-1);
  ans -= kaburu;
  cout<<ans<<endl;
  return 0;
}


Measured memory_bytes: 2800