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<algorithm>
using namespace std;
int n,d[200010];
pair<long long,int> P[200010];
int bit[200010];
int Sum(int x){
	int ret=0;
	while(x)ret+=bit[x],x-=x&-x;
	return ret;
}
void Add(int x,int a){
	while(x<=n+1)bit[x]+=a,x+=x&-x;
}
int main(){
	long long k,a,sum=0;
	cin>>n>>k>>a;sum=a-k;
	P[0]=make_pair(0,0),P[1]=make_pair(sum,1);
	for(int i=2;i<=n;i++){
		cin>>a;sum+=a-k;
		P[i]=make_pair(sum,i);
	}
	sort(P,P+n+1);
	for(int i=0;i<=n;i++)d[P[i].second]=i;
	for(int i=1;i<=n+1;i++)bit[i]=0;
	long long ans=0;
	for(int i=0;i<=n;i++){
		ans+=Sum(d[i]+1);
		Add(d[i]+1,1);
	}
	cout<<ans<<endl;
	return 0;
}
