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;

long long int a[200001],tmp[200001];
long long int ans=0;
void mergesort(int l,int r){
	if(l==r)	return;
	int mid=(l+r)/2;
	mergesort(l,mid);mergesort(mid+1,r);
	int lcnt=l,rcnt=mid+1,cnt=0;
	while(lcnt<=mid&&rcnt<=r){
		if(a[lcnt]<=a[rcnt]){
			ans+=r-rcnt+1;
			tmp[cnt++]=a[lcnt++];
		}
		else
			tmp[cnt++]=a[rcnt++];
	}
	while(lcnt<=mid)
		tmp[cnt++]=a[lcnt++];
	while(rcnt<=r)
		tmp[cnt++]=a[rcnt++];
	for(int i=l;i<=r;i++)
		a[i]=tmp[i-l];
}
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n,k;
	cin>>n>>k;
	for(int i=1;i<=n;i++)
		cin>>a[i];
	for(int i=1;i<=n;i++)
		a[i]=a[i]+a[i-1]-k;
	mergesort(0,n);
	cout<<ans<<endl;
}
