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;
const int maxn=200010;
int n,k;
int a[maxn];
ll sum[maxn], num[maxn], ans, c[maxn]; 
int cnt;

int lowbit(int x){ return x&(-x); }
ll Sum(int x){
	ll ret=0;
	while(x){ ret+=c[x]; x-=lowbit(x); }
	return ret;
}
void add(int x){ while(x<maxn){ c[x]++; x+=lowbit(x); } }

int main(){

	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]), a[i]-=k, sum[i]=sum[i-1]+a[i];
	for(int i=1;i<=n;i++) num[++cnt]=sum[i];
	num[++cnt]=0;
	sort(num+1,num+1+cnt);
	cnt=unique(num+1,num+1+cnt)-num-1;
	add(lower_bound(num+1,num+1+cnt,0)-num);
	for(int i=1;i<=n;i++){
		ans+=Sum(lower_bound(num+1,num+1+cnt,sum[i])-num);
		add(lower_bound(num+1,num+1+cnt,sum[i])-num);
	}
	printf("%lld\n", ans);
	return 0;
}