Problem: Snuke has a permutation (P_0,P_1,\cdots,P_{N-1}) of (0,1,\cdots,N-1).

Now, he will perform the following operation exactly once:

* Choose K consecutive elements in P and sort them in ascending order.



Find the number of permutations that can be produced as P after the operation.

Constraints

* 2 \leq N \leq 200000
* 2 \leq K \leq N
* 0 \leq P_i \leq N-1
* P_0,P_1,\cdots,P_{N-1} are all different.
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N K
P_0 P_1 \cdots P_{N-1}


Output

Print the number of permutations that can be produced as P after the operation.

Examples

Input

5 3
0 2 1 4 3


Output

2


Input

4 4
0 1 2 3


Output

1


Input

10 4
2 0 1 3 7 5 4 6 8 9


Output

6

Solution (in CPP):

Solution:
#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <algorithm>
#include <iomanip>
#include <string.h>

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()

typedef long long lint;

using namespace std;

int main(){
  int N,K;
  cin>>N>>K;
  int P[N];
  REP(i,N)cin>>P[i];
  set<int> s;
  REP(i,K)s.insert(P[i]);
  int ans=1;
  REP(i,N-K){
    if(P[i]==*s.begin() and P[i+K]>*s.rbegin())ans--;
    // cerr<<*s.begin()<<" "<<*s.rbegin()<<endl;
    ans++;
    s.erase(P[i]);
    s.insert(P[i+K]);
  }
  int a=0,b=1;
  FOR(i,1,N){
    if(P[i-1]<P[i])b++;
    else b=1;
    if(b==K)a++;
  }
  ans-=max(a-1,0);
  cout<<ans<<endl;
  return 0;
}