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<algorithm>
using namespace std;
struct kk
{
	long long num;
	int id,im;
}s[200010];
#define lowbit(x) x&(-x)
bool cmp1(kk A,kk B)
{
	return A.num<B.num||(A.num==B.num&&A.id<B.id);
}
bool cmp2(kk A,kk B)
{
	return A.id<B.id;
}
int c[200010],n;
long long k,ans,x;
void modify(int s,int x)
{	
    for (;s<=n+1;s+=lowbit(s))	   
	   c[s]+=x;
}
int sum(int s)
{	
    int ans=0;	
	for (int i=s;i;i-=lowbit(i))	   
	  ans+=c[i];	
	return ans;
}
int main()
{
	scanf("%d%lld",&n,&k);
	s[0].num=0;s[0].id=0;
	int i;
	for (i=1;i<=n;i++)
	{
		scanf("%d",&x);
		s[i].num=s[i-1].num+x-k;
		s[i].id=i;
	}
	sort(s,s+n+1,cmp1);
	for (i=0;i<=n;i++) s[i].im=i+1;
	sort(s,s+n+1,cmp2);
	long long ans=0;
	for (i=0;i<=n;i++)
	{
		ans+=sum(s[i].im);
		modify(s[i].im,1);
	}
	printf("%lld\n",ans);
}
//BIT:binary indexed tree