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 <bits/stdc++.h>

using namespace std;
#define int long long
#define all(v) v.begin(), v.end()
const int N = 2e5 + 5;
int fen[N], a[N];

void add(int idx) {
    for (idx++; idx < N; idx += idx&(-idx)) fen[idx]++;
    return ;
}
int get(int idx) {
    int res = 0;
    for (idx++; idx; idx -= idx&(-idx)) res += fen[idx];
    return res;
}

int32_t main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int n, k, ans = 0; cin >> n >> k;
    vector <int> vec = {0};
    for (int i = 1; i <= n; i++) cin >> a[i], a[i] += a[i - 1] - k, vec.push_back(a[i]);
    sort(all(vec)), vec.resize(unique(all(vec)) - vec.begin());
    for (int i = 0; i <= n; i++) {
        int x = lower_bound(all(vec), a[i]) - vec.begin();
        ans += get(x), add(x);
    }
    cout << ans << "\n";
}
