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;
int n,k,a[200005],b[200005],bit[530000];
long long pre[200005],ans;
vector<long long> v;
map<long long,int> m;
void upd(int x,int val) {
    while (x!=0) {
        bit[x]+=val; x-=(x&(-x));
    }
}
int que(int x) {
    int ret=0;
    while (x!=2*524288) {
        ret+=bit[x]; x+=(x&(-x));
    }
    return ret;
}
int main() {
    cin>>n>>k;
    for (int i=1; i<=n; i++) {cin>>a[i]; b[i]=a[i]-k;}
    v.push_back(0);
    for (int i=1; i<=n; i++) {pre[i]=pre[i-1]+b[i]; v.push_back(pre[i]);}
    sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end());
    for (int i=0; i<v.size(); i++) m[v[i]]=i+1;
    for (int i=1; i<=n; i++) upd(m[pre[i]],1);
    for (int i=1; i<=n; i++) {
        ans+=que(m[pre[i-1]]);
        upd(m[pre[i]],-1);
    }
    cout<<ans<<'\n';
}