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<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,k,cnt,a,bit[(1LL<<20)],ans;
vector<ll>v,v2,v1;
ll sum(ll i){
    ll s=0;
    while(i>0){
        s+=bit[i];
        i-=i&-i;
    }
    return s;
}
void add(ll i,ll x){
    while(i<=n+1){
        bit[i]+=x;
        i+=i&-i;
    }
    return ;
}
int main(void){
    cin>>n>>k;
    for(int i=0;i<n;i++){
        v.push_back(cnt);
        v2.push_back(cnt);
        cin>>a;
        cnt+=a;
        cnt-=k;
    }
    v.push_back(cnt);
    v2.push_back(cnt);
    sort(v2.begin(),v2.end());
    for(int i=0;i<=n;i++){
        ll L=lower_bound(v2.begin(),v2.end(),v[i])-v2.begin();
        v1.push_back(L+1);
    }
    for(ll x:v1){
        ans+=sum(x);
        add(x,1);
    }
    cout<<ans<<endl;
}
