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;
typedef long long ll;
ll n,k,a[200010],s[200010],u[100010];
ll count(int l,int r)
{
	int mid=l+r>>1;
	if(l==r)
		return 0;
	int tot=0;
	ll ans=0;
	for(int i=mid+1;i<=r;i++)
		u[tot++]=s[i];
	sort(u,u+tot);
	for(int i=l;i<=mid;i++)
		if(s[i]<=u[tot-1])
			ans+=u+tot-lower_bound(u,u+tot,s[i]);
	ans+=count(l,mid);
	ans+=count(mid+1,r);
	return ans;
}
int main()
{
	scanf("%lld%lld",&n,&k);
	for(int i=1;i<=n;i++)
	{
		scanf("%lld",&a[i]);
		a[i]-=k;
	}
	for(int i=1;i<=n;i++)
		s[i]=s[i-1]+a[i];
	printf("%lld",count(0,n)); 
}