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<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N=1000020;
ll n,p,i,a,s[N],c[N],k,ans;
struct Uzi{
	ll val,id;
	bool operator<(const Uzi &k)const{
		if(k.val!=val)
			return k.val>val;
		return k.id>id;
	}
}x[N];
void init(){
	scanf("%lld%lld",&n,&k);
	n++;
	for(i=2;i<=n;i++){
		scanf("%lld",&a);
		a-=k;
		s[i]=s[i-1]+a;
	}
	for(i=1;i<=n;i++)
		x[i]=(Uzi){s[i],i};
	sort(x+1,x+n+1);
}
void work(){
	for(i=1;i<=n;i++){
		for(k=x[i].id;k;k-=k&-k)
			ans+=c[k];
		for(k=x[i].id;k<=n;k+=k&-k)
			c[k]++;
	}
	printf("%lld",ans);
	//while(1);
}
int main(){
	init();
	work();
	return 0;
}