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 unsigned long long ull;
typedef long long ll;

#define MAX 200000

int n, bit[MAX+2], bit_size;

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

void add(int i, int x){
	while(i<=bit_size){
		bit[i]+=x;
		i+=(i&-i);
	}
	return;
}

int main(){
	ll k;
	cin >> n >> k;
	vector<ll> s(n+1, 0);
	for(int i=1; i<=n; i++){
		ll a;
		cin >> a;
		s[i]=s[i-1]+a-k;
	}

	vector<ll> v=s;
	sort(v.begin(), v.end());
	v.erase(unique(v.begin(), v.end()), v.end());
	for(int i=0; i<=n; i++){
		s[i]=lower_bound(v.begin(), v.end(), s[i])-v.begin()+1;
	}

	bit_size=v.size();
	ll ans=0;
	for(int i=0; i<=n; i++){
		ans+=sum(s[i]);
		add(s[i], 1);
	}
	cout << ans << endl;
	return 0;
}