#pragma GCC target("avx")
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DB double
#define LD long double
#define ST string
#define BS bitset
#define PA pair<LL,LL>
#define VE vector
#define VL vector<LL>
#define VP vector<pair<LL,LL>>
#define VVL vector<vector<LL>>
#define PQ priority_queue
#define PQS priority_queue<LL,vector<LL>,greater<LL>>
#define PB push_back
#define POB pop_back
#define PF push_front
#define POF pop_front
#define EB emplace_back
#define MP make_pair
#define TS to_string
#define TU to_ullong
#define BPL __builtin_popcountll
#define FOR(i,a,n) for(i=a;i<n;++i)
#define FORR(i,a,n) for(i=n-1;i>=a;--i)
#define rep(i,n) FOR(i,0,n)
#define repr(i,n) FORR(i,0,n)
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define SORT(a) sort(ALL(a))
#define REV(a) reverse(ALL(a))
#define UB(a,n) *upper_bound(ALL(a),n)
#define LB(a,n) *lower_bound(ALL(a),n)
#define INF 1145141919810364364
#define PI 3.14159265358979
#define MOD 1000000007
//#define MOD 998244353
#define ERR 0.00000001
#define NUM 200010
#define FAST cin.tie(0);ios::sync_with_stdio(false)

void Yn(LL a){if(a)printf("Yes\n");else printf("No\n");}
void YN(LL a){if(a)printf("YES\n");else printf("NO\n");}
LL pwmn(LL a,LL n){LL ans=1;while(ans<a)ans*=n;return ans;}
LL dig(LL n){LL ret=0;while(n)n/=10,ret++;return ret;}
LL LBn(VL &v,LL a){LL mx=v.size(),mn=-1,md;while(mx-mn>1){md=(mx+mn)/2;if(v[md]<a)mn=md;else mx=md;}return mx;}
LL GCD(LL a,LL b){LL c=1,tmp=max(a,b);b=min(a,b);a=tmp;while(c!=0){c=a%b;a=b;b=c;}return a;}
LL LCM(LL a,LL b){return a*b/GCD(a,b);}
int lcmp(const void* a,const void* b){if(*(LL*)a>*(LL*)b)return 1;if(*(LL*)a<*(LL*)b)return -1;return 0;}
int lcmpr(const void* a,const void* b){if(*(LL*)a>*(LL*)b)return -1;if(*(LL*)a<*(LL*)b)return 1;return 0;}
int ccmp(const void* a,const void* b){return *(char*)a-*(char*)b;}
int ccmpr(const void* a,const void* b){return *(char*)b-*(char*)a;}
int scmp(const void* a,const void* b){return strcmp((char*)a,(char*)b);}
int scmpr(const void* a,const void* b){return strcmp((char*)b,(char*)a);}
LL cmod(LL a,LL m){if(a%m<0)return a%m+abs(m);else return a%m;}
LL DIV(LL a,LL d,LL m){LL l=m,x=1,y=0,k;while(l){k=d/l;d-=k*l;swap(l,d);x-=k*y;swap(x,y);}return cmod(a*cmod(x,m),m);}
LL POW(LL a,LL n,LL m){LL ans=1;while(n>0){if(n&1)ans=ans*a%m;a=a*a%m;n>>=1;}return ans;}
LL fact[NUM],finv[NUM],inv[NUM];
void comi(){LL i;fact[0]=fact[1]=1;finv[0]=finv[1]=1;inv[1]=1;FOR(i,2,NUM){fact[i]=fact[i-1]*i%MOD;inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;finv[i]=finv[i-1]*inv[i]%MOD;}}
LL com(LL n,LL k){if(n<k||n<0||k<0)return 0;return fact[n]*(finv[k]*finv[n-k]%MOD)%MOD;}
bool cmps(pair<LL,LL> a,pair<LL,LL> b){if(a.second!=b.second)return a.second<b.second;return a.first<b.first;}
template<typename T>bool chmax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T &a,T b){if(a>b){a=b;return true;}return false;}

struct Segx{
private:LL st;VL node;
public:
  Segx(LL n,LL a){st=pwmn(n,2);node.resize(2*st-1,a);}
  Segx(VL v){LL i;st=pwmn(v.size(),2);node.resize(2*st-1);rep(i,v.size())node[i+st-1]=v[i];for(i=st-2;i>=0;--i)node[i]=max(node[2*i+1],node[2*i+2]);}
  void sadd(LL i,LL n){i+=st-1;node[i]=n;while(i>0){i=(i-1)/2;node[i]=max(node[2*i+1],node[2*i+2]);}}
  LL smax(LL a,LL b,LL k=0,LL l=0,LL r=-1){if(r<0)r=st;if(r<=a||b<=l)return 0;if(a<=l&&r<=b)return node[k];return max(smax(a,b,2*k+1,l,(l+r)/2),smax(a,b,2*k+2,(l+r)/2,r));}
};
struct Segn{
	LL st;VL node;
  Segn(LL n,LL a){st=pwmn(n,2);node.resize(2*st-1,a);}
  Segn(VL v){LL i;st=pwmn(v.size(),2);node.resize(2*st-1);rep(i,v.size())node[i+st-1]=v[i];for(i=st-2;i>=0;--i)node[i]=min(node[2*i+1],node[2*i+2]);}
  void sadd(LL i,LL n){i+=st-1;node[i]=n;while(i>0){i=(i-1)/2;node[i]=min(node[2*i+1],node[2*i+2]);}}
  LL smin(LL a,LL b,LL k=0,LL l=0,LL r=-1){if(r<0)r=st;if(r<=a||b<=l)return INF;if(a<=l&&r<=b)return node[k];return min(smin(a,b,2*k+1,l,(l+r)/2),smin(a,b,2*k+2,(l+r)/2,r));}
};

int main(){
	FAST;
	LL i,N,K,a=1,ans,f=0;
	cin>>N>>K;
	ans=N-K+1;
	VL P(N);
	rep(i,N)cin>>P[i];
	Segx x(P);Segn n(P);
	rep(i,N-1){
		if(P[i]<P[i+1])++a;
		else a=1;
		if(a==K){
			if(f)--ans;
			f=1;
		}
	}
	rep(i,N-K)if(P[i]<n.smin(i+1,i+K)&&P[i+K]>x.smax(i+1,i+K))--ans;
	cout<<ans<<endl;
}


Measured memory_bytes: 11620