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<vector>
#define LL long long
int BIT[200010];
std::vector<LL> S;
LL N, K;
LL A[200010];
LL sum, ans;

void update(int n, int x) {
	for (int i = n; i <= N; i += i & -i) {
		BIT[i] += x;
	}
}
int getsum(int n) {
	int ss = 0;
	for (int i = n; i > 0; i -= i & -i) {
		ss += BIT[i];
	}
	return ss;
}

int main() {
	std::cin >> N >> K;
	for (LL i = 1; i <= N; i++) {
		LL tmp;
		std::cin >> tmp;
		sum += tmp;
		LL add = i * K;
		A[i] = sum - add;
		S.emplace_back(A[i]);
		if (A[i] >= 0)ans++;
	}
	std::sort(S.begin(), S.end());
	for (int i = 1; i <= N; i++) {
		auto it = std::upper_bound(S.begin(), S.end(), A[i] - 1);
		A[i] = it - S.begin() + 1;
	}
	for (int i = 1; i <= N; i++) {
		ans += getsum(A[i]);
		update(A[i], 1);
	}
	std::cout << ans << std::endl;
	return 0;
}