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<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 200040
using namespace std;
int n,k;
long long ans=0,aux[N],sum[N];
long long tree[N];
int lowbit(int x)
{
	return x&-x;
}
long long getsum(int x)
{
	long long ans=0;
	for(int i=x;i;i-=lowbit(i))
	ans+=tree[i];
	return ans;
}
void add(int x,int k)
{
	for(int i=x;i<=n+16;i+=lowbit(i))
	tree[i]+=k;
}

int main()
{
	memset(sum,0,sizeof(sum));
	memset(aux,0,sizeof(aux));
	memset(tree,0,sizeof(tree));
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++)
	{
		int x;
		scanf("%d",&x);
		sum[i]=sum[i-1]+x-k;
		aux[i]=sum[i];
	}
	sort(aux,aux+1+n);
	int m=unique(aux,aux+1+n)-aux;
	for(int i=0;i<=n;i++)
	sum[i]=lower_bound(aux,aux+1+m,sum[i])-aux+1;
	for(int i=0;i<=n;i++)
	{
		ans+=getsum(sum[i]);
		add(sum[i],1);
	}
	printf("%lld\n",ans);
	return 0;
}