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<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<cstdio>
#include<set>
#include<queue>
#include<map>
using namespace std;
long long s[200005],ts[200005],in[200005];
void p(int pos)
{
	while(pos<=200003)
	{
		in[pos]+=1;
		pos+=pos&(-pos);
	}
	
}
long long sum(int n)
{
	long long sum=0;
	while(n>0)
	{
		sum+=in[n];
		n-=n&(-n);
	}
	return sum;
}
int main()
{

	int n,k,x;
	long long ans=0;
	memset(s,0,sizeof(s));
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++)  	
	{
		scanf("%d",&x),s[i]=x-k+s[i-1],ts[i]=s[i];
		if(s[i]>=0)
		ans++;
		}
	sort(ts+1,ts+1+n);
	int size=unique(ts+1,ts+1+n)-ts+1;
	for(int i=1;i<=n;i++)   s[i]=lower_bound(ts+1,ts+1+size,s[i])-ts;
	memset(in,0,sizeof(in));
	for(int i=1;i<=n;i++)
		{
			ans+=sum(s[i]);
			p(s[i]);
		}
	
	printf("%lld\n",ans);
	return 0;
 } 