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 LL long long
#define MAXN 200005
using namespace std;

int N,K;
int a[MAXN];
LL s[MAXN], c[MAXN];
//
int fw[MAXN];
int lbt(int x){
	return x & (-x);
}

void update(int x, int dv){
	for(;x<=N;x+=lbt(x)){
		fw[x] += dv;
	}
}

int getsum(int x){
	int ans = 0;
	for(;x>0;x-=lbt(x)){
		ans += fw[x];
	}
	return ans;
} 


int main(){
	
	cin>>N>>K;
	for(int i=1;i<=N;i++){
		cin>>a[i];
		a[i] -= K;
		
		s[i] = s[i-1] + a[i];
	}
	
	memcpy(c, s, sizeof(s));
	sort(c+1, c+1+N);
	
	LL ans = 0;

	for(int i=1;i<=N;i++){
		if(s[i]>=0) ++ans;
		
		s[i] = lower_bound(c+1, c+1+N, s[i]) - c;
		ans += getsum(s[i]);
		update(s[i], 1);
	}
	
	cout<<ans<<endl;
	
	return 0;
}