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
n,k=map(int,input().split())
a=[int(input())for i in range(n)]
from itertools import accumulate
l=[0]+list(accumulate(a))
l=[j-k*i for i,j in enumerate(l)]

#座圧
a_to_i={a:i for i,a in enumerate(sorted(set(l)),1)}
b=[a_to_i[a]for a in l]

size=len(a_to_i)+2
bit=[0]*size

#x(index)の値にvを足す
#indexは1スタート
def bit_update(x,v):
    while x<size:
        bit[x]+=v
        x+=(x&-x) #区間の長さ

#bit_1 + bit_2 + … + bit_nをO(log(n))で求める
def bit_sum(n):
    s=0
    if n==0:return 0
    x=n
    while x>0:
        s+=bit[x]
        x-=(x&-x)
    return s

ans=0
for i in b:
    ans+=bit_sum(i)
    bit_update(i,1)
print(ans)