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
#include <iostream>
#include <algorithm>
#define MAX 200005
using namespace std;

typedef long long ll;
ll N, bit[MAX] = {};

void update(ll x, ll delta) {
    for (;x <= N+1; x += x&-x) bit[x] += delta;
}

ll query(ll x) {
    ll sum = 0;
    for (;x > 0; x -= x&-x) sum += bit[x];
    return sum;
}

int main() {
    ll K, a[MAX], b[MAX], c[MAX], i;
    cin >> N >> K;
    b[0] = 0, c[0] = 0;
    for (i = 0; i < N; i++) cin >> a[i], a[i] -= K, b[i+1] = b[i]+a[i], c[i+1] = b[i+1];
    sort(c, c+N+1);

    ll res = 0;
    for (i = 0; i <= N; i++) {
        ll ind = lower_bound(c, c+N+1, b[i])-c+1;
        res += query(ind);
        update(ind, 1);
    }
    cout << res << '\n';
}