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;
int n,k,lb;
long long int a[222222],b[222222];
int bit[222222];
int lowbit(int x){return x&-x;}
int query(int x){
	int r=0 ;
	while(x){
		r+=bit[x];
		x -= lowbit(x);
	}
	return r;
}
void upd(int x){
	while(x<=lb){
		bit[x]++;
		x+=lowbit(x);
	}
}
int main(){
	scanf("%d%d",&n,&k);
	for(int i=1; i<=n; i++){
		int x;
		scanf("%d",&x);
		a[i] = a[i-1] + x;
	}
	for(int i=0; i<=n; i++){
		a[i] -= (long long int)i*k;
		b[lb++] = a[i];
	}
	sort(b,b+lb);
	lb=unique(b,b+lb)-b;
	long long int res = 0;
	for(int i=0; i<=n; i++){
		int w = lower_bound(b,b+lb,a[i])-b+1;
		res += query(w);
		upd(w);
	}
	cout << res << endl;
	return 0;
}
