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;
struct tr
{
	int t[202020];
	void gx(int xh,int vl)
	{
		xh++;
		while(xh<202020)
		{
			t[xh]+=vl;
			xh+=xh&-xh;
		}
	}
	int gt1(int xh)
	{
		xh++;
		int ans=0;
		while(xh>0)
		{
			ans+=t[xh];
			xh-=xh&-xh;
		}
		return ans;
	}
};
tr tt;
int n;
long long k,cnt[202020],ans;
int main()
{
	cin>>n>>k;
	for(int i=1;i<=n;i++)
	{
		cin>>cnt[i];
		cnt[i]-=k;
		cnt[i]+=cnt[i-1];
	}
	vector<long long>v;
	for(int i=0;i<=n;i++)
	{
		v.push_back(cnt[i]);
	}
	sort(v.begin(),v.end());
	v.erase(unique(v.begin(),v.end()),v.end());
	for(int i=0;i<=n;i++)
	{
		int p=lower_bound(v.begin(),v.end(),cnt[i])-v.begin();
		ans+=tt.gt1(p);
		tt.gx(p,1);
	}
	cout<<ans<<endl;
	return 0;
}