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;

long long n,k,A[200050],fw[200050];

void update(long long p, long long v)
{
	for(; p<=n; p+=p&(-p)) 
		fw[p]+=v;
}

long long query(long long p)
{
	long long ans=0;
	for(; p; p-=p&(-p)) 
		ans+=fw[p];
	return ans;
}

int main()
{
	cin>>n>>k;
	vector<long long> v;
	for(long long i=1; i<=n; i++)
	{
		cin>>A[i];
		A[i]+=A[i-1];
		v.push_back(A[i]-k*i);
	}
	sort(v.begin(), v.end());
	long long ans=0;
	for(long long i=0; i<=n; i++)
	{
		long long val=lower_bound(v.begin(), v.end(), A[i]-k*i)-v.begin()+1;
		ans+=query(val);
		update(val,1);
	}
	cout<<ans;
}
