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 rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;

int n, k;
ll a[200200], sum[200200];
set<ll> sums;
map<ll, ll> mp;
ll bit[200200];
int cnt = 0;
void update(int pos){
	while(pos <= cnt){
		bit[pos]++;
		pos += (pos & -pos); 
	}
}
ll query(int pos){
	ll sum = 0;
	while(pos >= 1){
		sum += bit[pos];
		pos -= (pos & -pos); 
	}
	return sum;
}

int main(){
	scanf("%d%d", &n, &k);
	ll ans = 0;
	rep(i, n){
		scanf("%d", &a[i]);
		a[i] -= k;
		sum[i+1] = sum[i] + a[i];
		sums.insert(sum[i]);
	}
	sums.insert(sum[n]);
	for(set<ll>::iterator it = sums.begin(); it != sums.end(); it++){
		mp[*it] = ++cnt;
	}
	rep(i, n+1) sum[i] = mp[sum[i]];
	rep(i, n+1){
		ans += query(sum[i]);
		update(sum[i]);	
	}
	cout << ans << endl;
	return 0;
}