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
def main():
    from sys import stdin
    input=stdin.readline
    from itertools import accumulate as ac

    n, k = map(int, input().split())
    a = [int(input())-k for _ in [0]*n]

    # bit木を作る
    bit = [0]*(n+2)

    # aにwを足す
    def add(a, w):
        x = a
        while x < n+2:
            # print(x)
            bit[x] += w
            x += x & (-x)

    # aまでの和をとる
    def sum_(a):
        ret = 0
        x = a
        while x > 0:
            ret += bit[x]
            x -= x & (-x)
        return ret

    aca = [0]+list(ac(a))
    aca = sorted([(i, j) for i, j in enumerate(aca)],
                 key=lambda x: -x[1])+[(0, 10**20)]
    temp = []
    temp2 = [aca[0][0]]
    for i in range(1, n+2):
        if aca[i][1] == aca[i-1][1]:
            temp2.append(aca[i][0])
        else:
            temp.append(temp2)
            temp2 = [aca[i][0]]
    ans = 0
    for temp2 in temp:
        l=len(temp2)
        ans += l*(l-1)//2
        for i in temp2:
            ans += sum_(n+1)-sum_(i)
        for i in temp2:
            add(i+1, 1)
    print(ans)


main()