Mr Potato is a coder.
Mr Potato is the BestCoder.
One night, an amazing sequence appeared in his dream. Length of this sequence is odd, the median number is M, and he named this sequence as [I]Bestcoder Sequence[/I].
As the best coder, Mr potato has strong curiosity, he wonder the number of consecutive sub-sequences which are [I]bestcoder sequences[/I] in a given permutation of 1 ~ N.
Input
Input contains multiple test cases.
For each test case, there is a pair of integers N and M in the first line, and an permutation of 1 ~ N in the second line.
[b][Technical Specification][/b]
1. 1 <= N <= 40000
2. 1 <= M <= N
Output
For each case, you should output the number of consecutive sub-sequences which are the [I]Bestcoder Sequences[/I].
Sample Input
1 1
1
5 3
4 5 3 2 1
Sample Output
1
3
Hint
For the second case, {3},{5,3,2},{4,5,3,2,1} are Bestcoder Sequence.
