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, fw[200005];
long long A[200005];
vector<long long> v;

void upd(int p) {
	p++;
	for (int i = p; i <= N; i += (i & (-i))) fw[i]++;
}

int qry(int p) {
	p++;
	int ans = 0;
	for (int i = p; i > 0; i-=(i&(-i))) ans += fw[i];
	return ans;
}

int main() {
	scanf("%d%d", &N, &K);
	for (int i = 0; i < N; i++) scanf("%lld", &A[i]);
	for (int i = 0; i < N; i++) A[i] -= K;
	for (int i = 1; i < N; i++) A[i] += A[i - 1];
	for (int i = 0; i < N; i++) v.push_back(A[i]);
	sort(v.begin(), v.end());
	for (int i = 0; i < N; i++) A[i] = lower_bound(v.begin(), v.end(), A[i]) - v.begin();
	long long ans = 0;
	for (int i = 0; i < N; i++) {
		ans += qry(A[i]);
		if (v[A[i]] >= 0) ans++;
		upd(A[i]);
	}
	printf("%lld\n", ans);
}
