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>
#define int long
const int N = 2e5 + 5;
using namespace std;

int n, k, p[N], bit[N];
long long a[N], ans;

void update(int i){
    while (i < N){
        bit[i]++;
        i += i&(-i);
    }
}

int get(int i){
    int ans = 0;
    while (i > 0){
        ans += bit[i];
        i -= i&(-i);
    }
    return ans;
}

signed main(){
    srand(time(NULL));
    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i++) a[i] += a[i-1] - k;
    for (int i = 0; i <= n; i++) p[i] = i;
    sort(p, p+1+n, [](int x, int y){return (a[x] < a[y] || (a[x] == a[y] && x < y));});
    for (int i = 0; i <= n; i++) a[p[i]] = i+1;
    update(a[0]);
    for (int i = 1; i <= n; i++){
        ans += get(a[i]);
        update(a[i]);
    }
    cout << ans;
}
