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>
#define ll long long
#define lowbit(x) ((x)&-(x))
using namespace std;
const int N=2e5+5;
int n,k,tot,a[N],c[N];
ll sum[N],b[N],ans,tmp[N];
void add(int x,int y)
{
	for(;x<=tot;x+=lowbit(x)) c[x]+=y;
}
int query(int x)
{
	int ans=0;
	for(;x;x-=lowbit(x)) ans+=c[x];
	return ans;
}
void discrete()
{
	sort(tmp+1,tmp+1+n);
	tot=unique(tmp+1,tmp+1+n)-tmp-1;
	for(int i=1;i<=n;i++)
		b[i]=lower_bound(tmp+1,tmp+1+tot,b[i])-tmp;
}
int main()
{
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]),sum[i]=sum[i-1]+a[i];
	for(int i=1;i<=n;i++) tmp[i]=b[i]=sum[i]-1ll*k*i;
	for(int i=1;i<=n;i++) ans+=b[i]>=0;
	discrete();
	for(int i=1;i<=n;i++){
		ans+=query(b[i]);
		add(b[i],1);
	}
	printf("%lld",ans);
	return 0;
}