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
#!/usr/bin/env python3


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

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

    def add(self, i, x):
        while i < self.size:
            self.tree[i] += x
            i |= i + 1


def solve(n, a):

    ans = 0

    s = []
    r = 0
    for i in range(n):
        r += a[i]
        s.append((r, i))
        if 0 <= r:
            ans += 1

    s.sort()

    bit = Bit(n)
    for tpl in s:
        _, i = tpl
        ans += bit.sum(i)
        bit.add(i, 1)

    return ans


def main():
    n, k = input().split()
    n = int(n)
    k = int(k)
    a = []
    for _ in range(n):
        ai = input()
        ai = int(ai) - k
        a.append(ai)

    print(solve(n, a))


if __name__ == '__main__':
    main()

