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>
#define pb push_back 
#define mp make_pair
using namespace std;

const int maxn=2e5+7;
typedef long long ll;

ll n,m,ans,k;
ll a[maxn],pre[maxn],t[maxn];

void mergesort(ll l,ll r)
{
	ll i,j,k,m;
	m=(l+r)/2;
	if(l==r) return;
	
	mergesort(l,m);
	mergesort(m+1,r);
	
	k=i=l,j=m+1;
	while(i<=m&&j<=r)
	{
		if(a[i]<=a[j])
		{
			ans+=r-j+1;
			t[k++]=a[i++];
		}
		else t[k++]=a[j++];
	}
	
	while(i<=m) t[k++]=a[i++];
	while(j<=r) t[k++]=a[j++];
	for(i=l;i<=r;++i) a[i]=t[i];
}

int main()
{
	int i,j;
	scanf("%lld%lld",&n,&k);
	
	for(i=1;i<=n;++i)
	{
		scanf("%lld",&a[i]);
		pre[i]=pre[i-1]+a[i];
		a[i]=pre[i]-i*k;
	}
	/*
	for(i=0;i<=n;++i)
	{
		printf("%lld ",a[i]);
	}
	printf("\n");
	*/
	mergesort(0,n);
	/*
	for(i=0;i<=n;++i)
	{
		printf("%lld ",a[i]);
	}
	printf("\n");
	*/
	printf("%lld",ans);
	return 0;
}
