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 _ in range(n)]

sm = 0
li = [[0, 0]]
for i, e in enumerate(a, 1):
    sm += e
    li.append([sm - k * i, i])

li.sort()
for i in range(n + 1):
    li[i][0] = i + 1

li.sort(key=lambda x: x[1])

bit = [0] * (n + 2)


def update(x):
    while x <= n + 1:
        bit[x] += 1
        x += x & (-x)


def sm(x):
    ret = 0
    while x:
        ret += bit[x]
        x -= x & (-x)

    return ret


ans = 0
for e, _ in li:
    ans += sm(e)
    update(e)

print(ans)
