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 rep(i,n) for(ll i=0;i<n;i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
const int MAX_N=200001;
int bit[MAX_N+1]={0},n;
int sum(int i){
    int s=0;
    while(i>0){
        s+=bit[i];
        i-=i&-i;
    }
    return s;
}
void add(int i,int x){
    while(i<=n+1){
        bit[i]+=x;
        i+=i&-i;
    }
}
int main(){
    int k;
    cin>>n>>k;
    ll ans=0;
    vec A(n),B(n+1,0);
    rep(i,n) cin>>A[i],A[i]-=k,B[i+1]=B[i]+A[i];
    vector<P> C;
    rep(i,n+1) C.push_back(P(B[i],i));
    sort(all(C));
    int a=1;
    rep(i,n+1){
        if(i&&C[i-1].first!=C[i].first) a++;
        B[C[i].second]=a;
    }
    for(int i=n;i>=0;i--){
        ans+=sum(n+1)-sum(B[i]-1);
        add(B[i],1);
    }
    cout<<ans<<"\n";
}