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>

long long a[200001],v[200001],s;int n;
inline void add(int p){ while(p<=n)v[p]++,p+=p&-p; }
inline int sum(int p){ int r=0;while(p)r+=v[p],p-=p&-p;return r; }
int main()
{
	int i,m;
	scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++)scanf("%lld",a+i),v[i]=a[i]=a[i]-m+a[i-1];

	std::sort(v+1,v+n+1);
	m=std::unique(v+1,v+n+1)-v-1;
	for(i=1;i<=n;i++)
		a[i]=std::lower_bound(v+1,v+m+1,a[i])-v;
	for(v[0]=-1;v[m]>=0;m--);

	for(i=1;i<=n;i++)v[i]=0;
	for(i=1;i<=n;i++)
		s+=sum(a[i])+(a[i]>m),add(a[i]);
	printf("%lld\n",s);
}
//😁😂😃😄😅😆😉😊😍😞