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 <bits/stdc++.h>
using namespace std;

#define REP(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))

typedef long long ll;

int main(void){
	int n, k;
	cin >> n >> k;

	vector<int> p(n);
	REP(i, n){
		cin >> p[i];
	}

	if(n == k){
		cout << 1 << endl;
		return 0;
	}

	int ans = n-k+1;
	int cnt = 0, sum = 0;
	REP(i, n-1){
		if(p[i] < p[i+1]) cnt++;
		else cnt = 0;
		if(cnt == k-1) sum++;
	}
	if(sum > 1) ans -= sum-1;

	set<int> st;
	REP(i, n){
		st.insert(p[i]);
		if(i >= k){
			if(p[i] == *st.rbegin() && p[i-k] == *st.begin()) ans--;
			st.erase(p[i-k]);
		}
	}

	cout << ans << endl;

	return 0;
}