You are given an integer sequence $a_1, a_2, \dots, a_n$.

Find the number of pairs of indices $(l, r)$ ($1 \le l \le r \le n$) such that the value of median of $a_l, a_{l+1}, \dots, a_r$ is exactly the given number $m$.

The median of a sequence is the value of an element which is in the middle of the sequence after sorting it in non-decreasing order. If the length of the sequence is even, the left of two middle elements is used.

For example, if $a=[4, 2, 7, 5]$ then its median is $4$ since after sorting the sequence, it will look like $[2, 4, 5, 7]$ and the left of two middle elements is equal to $4$. The median of $[7, 1, 2, 9, 6]$ equals $6$ since after sorting, the value $6$ will be in the middle of the sequence.

Write a program to find the number of pairs of indices $(l, r)$ ($1 \le l \le r \le n$) such that the value of median of $a_l, a_{l+1}, \dots, a_r$ is exactly the given number $m$.
The first line contains integers $n$ and $m$ ($1 \le n,m \le 2\cdot10^5$) — the length of the given sequence and the required value of the median.

The second line contains an integer sequence $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 2\cdot10^5$).
5 4
1 4 5 60 4
8
3 1
1 1 1
6
15 2
1 2 3 1 2 3 1 2 3 1 2 3 1 2 3
97
1 1
1
1
2 1
1 2
2
2 1
2 1
2
2 2
1 2
1
2 2
2 1
1
3 1
1 2 3
2
3 1
1 3 2
2
3 1
2 1 3
3
3 1
2 3 1
2
3 1
3 1 2
3
3 1
3 2 1
2
2 2
1 1
0
3 2
1 1 2
1
2 1
1 1
3
1 1
2
0
2 2
4 1
0
3 3
5 5 3
2
4 3
3 5 2 3
6
5 2
1 9 2 8 10
5
6 5
7 2 11 8 9 12
0
7 5
14 4 1 11 12 3 4
0
8 2
2 6 11 14 10 9 9 5
2
9 8
10 8 8 15 1 2 13 8 6
27
10 7
14 20 3 3 8 16 17 13 6 4
0
1 200000
1
0
1 200000
200000
1
from itertools import accumulate
from collections import Counter


s = input()
s = s.split(' ')
m = int(s[1])

t = input()
t = t.split(' ')
t = [int(x) for x in t]

locations = []
for i in range(len(t)):
    if t[i] == m:
        locations.append(i)

total_amount = 0
for location in locations:
    right = []
    for i in range(location+1, len(t)):
        if t[i] > m:
            right.append(1)
        elif t[i] == m:
            right.append(0)
        else:
            right.append(-1)
    right_cumulative_sum = list(accumulate(right))

    left = []
    for i in range(location):
        if t[i] > m:
            left.append(1)
        elif t[i] == m:
            right.append(0)
        else:
            left.append(-1)
    left = left[::-1]
    left_cumulative_sum = list(accumulate(left))

    right_count = Counter(right_cumulative_sum)
    left_count = Counter(left_cumulative_sum)
    right_count[0] += 1
    left_count[0] += 1
    right_count = dict(right_count)
    left_count = dict(left_count)

    amount = 0
    for key in right_count:
        if -key in left_count:
            amount += right_count[key]*left_count[-key]
        if -key+1 in left_count:
            amount += right_count[key]*left_count[-key+1]
    total_amount += amount

print(total_amount)

# Sat Oct 02 2021 19:46:16 GMT+0300 (Москва, стандартное время)
