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,ans,a[200005],b[200005],c[200005],bit[200005];
void upd(long long x){for(;x<200005;x+=(x&(-x)))bit[x]++;}
long long qry(long long x){long long res=0;for(;x;x-=(x&(-x)))res+=bit[x];return res;}
int main()
{
	cin>>n>>k;
	b[0]=c[0]=0;
	for(long long i=0;i<n;i++)cin>>a[i];
	for(long long i=0;i<n;i++)b[i+1]=b[i]+a[i]-k;
	for(long long i=0;i<n;i++)c[i+1]=b[i+1];
	sort(c,c+n+1);
	for(long long i=0;i<=n;i++)
	{
		long long x=lower_bound(c,c+n+1,b[i])-c+1;
		ans+=qry(x);
		upd(x);
	}
	cout<<ans<<endl;
	return 0;
}