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<cstring>
#include<iostream>
#include<algorithm>
#define rep(i,x,y) for(int i=x;i<=y;++i)
using namespace std;
const int Maxn=2e5+5;
long long n,a[Maxn],f[Maxn],tmp[Maxn],ans;
int k;
void msort(int l,int r)
{
	if(l==r)return;
	int mid=(l+r)>>1;
  	msort(l,mid);msort(mid+1,r);
  	int i=l,j=mid+1,k=l;
  	while(i<=mid&&j<=r)
	{
    	if(f[i]<=f[j])
      		tmp[k++]=f[i++];
    	else
		{
      		tmp[k++]=f[j++];
      		ans+=(mid-i+1);
    	}
  	}
  	while(i<=mid)tmp[k++]=f[i++];
  	while(j<=r)tmp[k++]=f[j++];
  	for(i=l;i<=r;i++)
    	f[i]=tmp[i];
}
int main()
{
	//freopen("std.in","r",stdin);
	cin>>n>>k;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
		f[i]=f[i-1]+a[i]-k;
	}
	msort(0,n);
	cout<<n*(n+1ll)/2ll-ans;
	return 0;
}