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;
int bit[200003],n,k;
pair<long long,int>a[200003]; 
int sum(int x){
	int ret=0;
	for(;x>=1;x-=x&(-x))ret+=bit[x];
	return ret;
}
void add(int x){
	for(;x<n+2;x+=x&(-x))bit[x]++; 
}
int main(){
	cin>>n>>k;
	for(int i=1;i<=n;i++)scanf("%lld",&a[i].first),a[i].first-=k,a[i].second=i+1;
	for(int i=0;i<n;i++)a[i+1].first+=a[i].first;
	for(int i=n;i>=0;i--)a[i+1]=a[i];
	a[1].second=1;
	sort(a+1,a+n+2);
	long long ans=0;
	for(int i=1;i<=n+1;i++){
		ans+=sum(a[i].second);
		//cout<<a[i].second<<' '<<sum(a[i].second)<<endl;
		add(a[i].second);
	}
	cout<<ans;
} 