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;
const int maxn = 234567;
int fen[maxn];
void add(int x, int v){
	for(; x < maxn; x += x & - x) fen[x] += v;
}
int sum(int x){
	int ans = 0;
	for(; x; x -= x & - x) ans += fen[x];
       	return ans;
}
int main(){
	int n, k; cin >> n >> k;
	vector<long long> a(n + 1, 0);
	for(int i = 1; i <= n; i++){
		cin >> a[i]; a[i] -= k;
		a[i] += a[i - 1];
	}
	vector<long long> b = a;
	sort(b.begin(), b.end());
	b.erase(unique(b.begin(), b.end()), b.end());
	long long ans = 0;
	for(int i = 0; i <= n; i++){
		int pt = lower_bound(b.begin(), b.end(), a[i] + 1) - b.begin();
		ans += sum(pt);
		pt = lower_bound(b.begin(), b.end(), a[i]) - b.begin();
		add(pt + 1, 1);
	}
	cout << ans << endl;
	return 0;
}
