PivotOJ

SREDNJI

시간 제한: 1000ms메모리 제한: 128MB출처: COCI 2007-2008BOJ 3013

문제

Consider a sequence A of integers, containing N integers between 1 and N. Each integer appears exactly once in the sequence. 

A subsequence of A is a sequence obtained by removing some (possibly none) numbers from the beginning of A, and then from the end of A. 

Calculate how many different subsequences of A of odd length have their median equal to B. The median of a sequence is the element in the middle of the sequence after it is sorted. For example, the median of the sequence {5, 1, 3} is 3.

입력

The first line contains two integers, N (1 ≤ N ≤ 100000) and B (1 ≤ B ≤ N). 

The second line contains N integers separated by spaces, the elements of sequence A.

출력

Output the number of subsequences of A whose median is B. 

힌트

In the third example, the four subsequences of A with median 4 are {4}, {7, 2, 4}, {5, 7, 2, 4, 3} and {5, 7, 2, 4, 3, 1, 6}.

예제

예제 1

입력
7 4
5 7 2 4 3 1 6
출력
4

예제 2

입력
6 3
1 2 4 5 6 3
출력
1

예제 3

입력
5 4
1 2 3 4 5
출력
2
코드를 제출하려면 로그인하세요.