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 <iostream>
#include <algorithm>
#include <utility>

#define MAX_N 200010
using namespace std;

long long bit[MAX_N+1],n;
pair<long long,int> p[MAX_N];
long long ans = 0,x = 0;

long long sum(long long i){
	long long s = 0;
	while(i>0){
		s += bit[i];
		i -= i&-i;
	}
	return s;
}

void add(long long i, int k){
	while(i<=n){
		bit[i] += k;
		i += i & -i;
	}
}


int main(){
	int i,k;
	long long a[MAX_N];
	cin >> n >> k;
	for(i=0;i<n;i++){
		bit[i] = 0;
	}
	
	for(i=0;i<n;i++){
		cin >> a[i];
		a[i] -= k;
		x += a[i];
		if(x>=0){
			ans += 1;
		}
		p[i] = make_pair(x,i);
	}
	
	sort(p,p+n);
	a[p[0].second] = 1;
	int j = 1;
	for(i=0;i<n-1;i++){
		if(p[i+1].first!=p[i].first){
			j++;
		}
		a[p[i+1].second] = j;
	}

	for(i=0;i<n;i++){
		ans += sum(a[i]);
		add(a[i],1);
	}
	
	cout << ans << endl;
}