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>
#define fi first
#define se second
#define mp make_pair
#define lo long long 
#define inf 1000000000
#define md 1000000007
#define pb push_back
#define li 200005
using namespace std;
lo int n,k,A[li],pre[li],fe[li+1005],cev;
vector< pair<lo int,lo int> > v;
void update(int x){
	for(int i=x;i<=n+1;i+=(i&-i)) fe[i]++; 
}
lo int que(lo int x){
	lo int res=0;
	for(int i=x;i>=1;i-=(i&-i)) res+=fe[i];
	return res;
}
int main(){
	scanf("%lld %lld",&n,&k);
	for(int i=1;i<=n;i++) {scanf("%lld",&A[i]);A[i]-=k;}
	for(int i=1;i<=n;i++) pre[i]=pre[i-1]+A[i];
	v.pb(mp(0,0));
	for(int i=1;i<=n;i++){
		v.pb(mp(pre[i],i));
	}
	sort(v.begin(),v.end());
	for(int i=0;i<(int)v.size();i++){
		update(v[i].se+1);
		if(v[i].se==0) continue;
		cev+=que(v[i].se);
	}
	printf("%lld\n",cev);
	return 0;
}
