You are given an integer sequence of length N, a = {a_1, a_2, …, a_N}, and an integer K.

a has N(N+1)/2 non-empty contiguous subsequences, {a_l, a_{l+1}, …, a_r} (1 ≤ l ≤ r ≤ N). Among them, how many have an arithmetic mean that is greater than or equal to K?

Constraints

* All input values are integers.
* 1 ≤ N ≤ 2 \times 10^5
* 1 ≤ K ≤ 10^9
* 1 ≤ a_i ≤ 10^9

Input

Input is given from Standard Input in the following format:


N K
a_1
a_2
:
a_N


Output

Print the number of the non-empty contiguous subsequences with an arithmetic mean that is greater than or equal to K.

Examples

Input

3 6
7
5
7


Output

5


Input

1 2
1


Output

0


Input

7 26
10
20
30
40
30
20
10


Output

13
import sys
input = sys.stdin.readline

n, k = [int(item) for item in input().split()]
a = [0] 
for i in range(n):
    a.append(int(input()) - k)
for i in range(1, n+1):
    a[i] += a[i - 1]
a_set = sorted(list(set(a)))
comp = dict() 
for i, item in enumerate(a_set):
    comp[item] = i
for i, item in enumerate(a):
    a[i] = comp[item]

n = len(a_set) + 5
bit = [0] * (n + 1) 

# Add w to ax 
def bit_add(x, w):
    while x <= n:
        bit[x] += w
        x += x & -x

# Sum a1 to ax 
def bit_sum(x):
    ret = 0
    while x > 0:
        ret += bit[x]
        x -= x & -x
    return ret

ans = 0
for item in a:
    ans += bit_sum(item + 1)
    bit_add(item + 1, 1)
print(ans)