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;
int read()
{
	int x=0,f=1;char ch=getchar();
	while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}
	while (ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
int n,k;
int a[200007];
pair<long long,int> sum[200007];
int c[400007];
long long ans=0;
void add(int x)
{
	while (x<=400000)
	{
		c[x]+=1;
		x+=x&(-x);
	}
}
int query(int x)
{
	int ans=0;
	while (x>0)
	{
		ans+=c[x];
		x-=x&(-x);
	}
	return ans;
}
int main()
{
	n=read(),k=read();
	for (int i=1;i<=n;i++) a[i]=read()-k;
	memset(sum,0,sizeof(sum));
	for (int i=1;i<=n;i++) sum[i].first=sum[i-1].first+a[i],sum[i].second=i+1;
	sum[n+1].first=0,sum[n+1].second=1;
	sort(sum+1,sum+n+2);
	for (int i=1;i<=n+1;i++)
	{
		ans+=query(sum[i].second);
		add(sum[i].second);
	}
	printf("%lld\n",ans);
	return 0;
}
