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;
typedef long long ll;
ll read(){
	ll a=0,b=getchar(),c=1;
	while(!isdigit(b))c=b=='-'?-1:1,b=getchar();
	while(isdigit(b))a=a*10+b-'0',b=getchar();
	return a*c;
}
ll n,k,a,s,ans,tr[200005];
pair<ll,ll> b[200005];
ll sum(ll p){
	ll res=0;
	while(p)res+=tr[p],p-=p&-p;
	return res;
}
void add(ll p){
	while(p<=n+1)tr[p]++,p+=p&-p;
}
int main(){
	n=read(),k=read();
	for(ll i=1;i<=n;i++){
		a=read();
		s+=a;
		b[i]={s-k*i,i};
	}
	sort(b,b+n+1);
	for(ll i=0;i<=n;i++){
		ans+=sum(b[i].second);
		add(b[i].second+1);
	}
	cout << ans;
	return 0;
}