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
/*
luogu AT2581
*/
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define lowbit(x) (x&-x)

int n,k,s[200005];
int ans,c[200005];
vector<int> v;

void lsh()
{
	sort(v.begin(),v.end());
	v.erase(unique(v.begin(),v.end()),v.end());
}

void fix(int x,int v)
{
	for(int i=x;i<=n;i+=lowbit(i))
		c[i] += v;
}

int ask(int x)
{
	int res=0;
	for(int i=x;i>=1;i-=lowbit(i))
		res += c[i];
	return res;
}

signed main()
{
	cin>>n>>k;
	for(int i=1,x;i<=n&&cin>>x;i++)
	{
		s[i] = s[i-1]+x;
		v.push_back(s[i]-k*i);
	}
	lsh();
	fix(lower_bound(v.begin(),v.end(),0)-v.begin()+1,1);
	for(int r=1;r<=n;r++)
	{
		int u=lower_bound(v.begin(),v.end(),s[r]-k*r)-v.begin()+1;
		ans += ask(u);
		fix(u,1);
	}
	cout<<ans<<endl;
	
	return 0;
}