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
sys.setrecursionlimit(10000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15

from itertools import permutations,product,combinations_with_replacement,groupby,accumulate,combinations
class BinaryIndexedTree():
    def __init__(self,N):
        self.N = N
        self.tree = [0] * (N + 1)
    
    def add(self,i,x):
        while i <= self.N:
            self.tree[i] += x
            i += (i & -i)
    
    def sum(self,i):
        ret = 0
        while i > 0:
            ret += self.tree[i]
            i -= (i & -i)
        return ret
    
    def lower_bound(self,x):#初めて和がx以上となるindex(0indexed)
        if x <= 0:
            return 0
        i = 0
        K = 1 << self.N.bit_length()
        while K > 0:
            if i + K <= self.N and self.tree[i + K] < x:
                x -= self.tree[i + K]
                i += K
            K >>= 1
        return i + 1
    
    def __str__(self):
        return ' '.join(map(str,self.tree))

def main():
    N,K = map(int,input().split())
    A = [int(input()) for _ in range(N)]
    A = [0] + [a - K for a in A]
    A = list(accumulate(A))

    compress = list(sorted(set(A)))
    dic = {c:i for i,c in enumerate(compress,1)}
    bit = BinaryIndexedTree(len(compress))
    ans = N*(N + 1)//2
    for i,a in enumerate(A):
        j = dic[a]
        ans -= i - bit.sum(j)
        bit.add(j,1)
    print(ans)
if __name__ == '__main__':
    main()