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;
#define N 201234
#define ll long long
map<ll,int>id;
ll bit[N];
int n,k,a[N];ll s[N],sb[N],sd[N];
int main(){
	int i,j=n;
	ll ans=0;
	scanf("%d%d",&n,&k);
	for(i=1;i<=n;i++)scanf("%d",a+i),s[i]=s[i-1]+a[i];
	for(i=1;i<=n;i++)sb[i]=s[i]=sd[i]=s[i-1]+a[i]-k;
	sort(sb+1,sb+n+1);
	int ln=unique(sb+1,sb+n+1)-sb-1;
	for(i=1;i<=ln;i++)id[sb[i]]=i;
	for(i=1;i<=n;i++)s[i]=id[s[i]];
	for(i=1;i<=n;i++){
		for(j=s[i];j;j-=j&-j)ans+=bit[j];
		for(j=s[i];j<=ln;j+=j&-j)bit[j]++;
		ans+=sd[i]>=0; 
	}
	cout<<ans;
	return 0;
}