#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vec;
typedef vector<vec> mat;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define revrep(i, n) for(ll i = (n)-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
/*
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll max3(ll a, ll b, ll c){return max(a, max(b, c));};
ll min3(ll a, ll b, ll c){return min(a, min(b, c));};
ll max4(ll a, ll b, ll c, ll d){return max(max(a, b), min(c, d));};
ll min4(ll a, ll b, ll c, ll d){return min(min(a, b), min(c, d));};
ll max5(ll a, ll b, ll c, ll d, ll e){return max(max(a, b), max3(c, d, e));};
ll min5(ll a, ll b, ll c, ll d, ll e){return min(min(a, b), min3(c, d, e));};
*/
const ll INFL = 1LL << 60;//10^18 = 2^60
const int INF = 1 << 30;//10^9
//ll MOD = 1000000007;
ll MOD = 998244353;

vector<ll> dy = {0, 0, 1, -1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, -1, 0, 0, 1, -1, 1, -1, 0};


ll pow_long(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x;
    k /= 2;
  }
  return res;
}
ll pow_mod(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2){
      res *= x; res %= MOD;
    }
    x *= x; x %= MOD;
    k /= 2;
  }
  return res;
}

ll inverse(ll x){return pow_mod(x, MOD - 2);};

ll gcd(ll a, ll b){
    if(b == 0) return a;
    return gcd(b, a % b);
}

ll lcm(ll x, ll y){return x / gcd(x, y) * y;};

ll kai_mod(ll x){
  if(x == 0) return 1;
  return x * kai_mod(x-1) % MOD;
}

/*
//コンビネーション
const int MAXcomb = 200010;
ll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
//facはn!,finvは1/n!
//invは逆元
void COMinit(){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i = 2; i < MAXcomb; i++){
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        finv[i] = finv[i-1] * inv[i] % MOD;
    }
}
ll comb(int n, int k){
    if(n < k) return 0;
    if(n < 0 || k < 0) return 0;
    return fac[n] * finv[k] % MOD * finv[n-k] % MOD;
}
*/

const ll N_ = (1 << 18);
ll seg1[2*N_-1];
//Range Minimum Query
void update1(ll k, ll x){
  k += N_-1;
  seg1[k] = x;
  while(k > 0){
    k = (k-1)/2;
    seg1[k] = min(seg1[2*k+1], seg1[2*k+2]);
  }
}

ll query1(ll x, ll y, ll k, ll left, ll right){
  if(right <= x || y <= left) return INFL;
  if(x <= left && right <= y) return seg1[k];
  ll mid = (left + right) / 2;
  ll l = query1(x, y, 2*k+1, left, mid);
  ll r = query1(x, y, 2*k+2, mid, right);
  return min(l, r);
}

ll seg2[2*N_-1];
//Range Maximum Query
void update2(ll k, ll x){
  k += N_-1;
  seg2[k] = x;
  while(k > 0){
    k = (k-1)/2;
    seg2[k] = max(seg2[2*k+1], seg2[2*k+2]);
  }
}

ll query2(ll x, ll y, ll k, ll left, ll right){
  if(right <= x || y <= left) return 0;
  if(x <= left && right <= y) return seg2[k];
  ll mid = (left + right) / 2;
  ll l = query2(x, y, 2*k+1, left, mid);
  ll r = query2(x, y, 2*k+2, mid, right);
  return max(l, r);
}



ll N, K;
vector<ll> P;

int main(){
  cin >> N >> K;
  P.resize(N);
  rep(i, N){
    cin >> P[i];
    update1(i, P[i]);
    update2(i, P[i]);
  }

  vector<ll> tmpsum(N, 0);
  for(ll i = 1; i < N; i++) tmpsum[i] = tmpsum[i-1] + (P[i-1] < P[i]);
  vector<bool> change(N-K+1);
  rep(i, N-K+1){
    if(tmpsum[i + K - 1] - tmpsum[i] == K - 1) change[i] = false;
    else change[i] = true;
  }

  ll ans = 0;
  bool noChange = false;
  rep(i, N-K+1) if(change[i] == false) noChange = true;
  if(noChange) ans = 1;

  rep(i, N-K+1){
    if(change[i] == 1) ans++;
  }


  rep(i, N-K){
    if(change[i] == 0 || change[i+1] == 0) continue;
    if(query1(i, i + K + 1, 0, 0, N_) == P[i] && query2(i, i + K + 1, 0, 0, N_) == P[i + K]) ans--;
  }
  cout << ans << endl;

}


Measured memory_bytes: 11136