### COCI 2007/2008, Contest #1

## Task SREDNJI

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.

### Input

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

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

### Output

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

### Examples

## Input5 4 1 2 3 4 5 ## Output2 |
## Input6 3 1 2 4 5 6 3 ## Output1 |
## Input7 4 5 7 2 4 3 1 6 ## Output4 |

In the fourth 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}.

All Submissions

Best Solutions

**Point Value:** 12

**Time Limit:** 1.00s

**Memory Limit:** 32M

**Added:** Aug 13, 2013

**Languages Allowed:**

C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3

## Comments (Search)

It's quiet in here...