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
from itertools import accumulate

class Bit:
    def __init__(self,n):
        self.size=n
        self.tree=[0]*(n+1)

    def sum(self,i):
        s=0
        while i>0:
            s+=self.tree[i]
            i-=i&-i
        return s
    
    def add(self,i,x):
        while i<=self.size:
            self.tree[i]+=x
            i+=i&-i

N,K=list(map(int,input().split()))
a=[0]*(N+1)

for i in range(N):
    a[i+1]=int(input())

accum=[(x-K*i,i) for i,x in enumerate(accumulate(a))]
accum.sort(key=lambda x: 10**10*x[0]+x[1])
plst=[x+1 for _,x in accum]
bit=Bit(N+1)
ans=0

for i,p in enumerate(plst):
    bit.add(p,1)
    ans+=i+1-bit.sum(p)

print(N*(N+1)//2-ans)