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<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
#define lowbit(x) x&(-x);
typedef long long ll;
const ll inf=1e18;
const int N=2e5+3;
int n,k;
ll a[N],b[N],c[N],d[N];
int sum(int x){
	int ans=0;
	while(x){
		ans+=c[x];
		x-=lowbit(x);
	}
	return ans;
}
void modify(int x){
	while(x<N){
		c[x]++;
		x+=lowbit(x);
	}
}
int main(){
	ll ans=0;
    cin>>n>>k;
    for(int i=1;i<=n;i++){
    	cin>>a[i];
    	a[i]+=a[i-1];
    	b[i]=a[i]-1LL*i*k;
    	d[i]=b[i];
    }
    sort(b+1,b+1+n);
    int m=unique(b+1,b+1+n)-b;
    for(int i=1;i<=n;i++) a[i]=lower_bound(b+1,b+1+m,d[i])-b;
    for(int i=1;i<=n;i++){
    	if(d[i]>=0) ans++;
    	ans+=sum(a[i]);
    	modify(a[i]);
    }
    cout<<ans<<endl;
    return 0;
}