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>

typedef long long LL;

const int N = 200005;
LL a[N], v[N], ans; int bit[N], n, k;
int main() {
	std::ios::sync_with_stdio(0), std::cin.tie(0);
	std::cin >> n >> k;
	for (int i = 1; i <= n; ++i)
		std::cin >> a[i], a[i] += a[i - 1] - k;
	for (int i = 0; i <= n; ++i) v[i] = a[i];
	std::sort(v, v + n + 1);
	for (int i = 0; i <= n; ++i) a[i] = std::lower_bound(v, v + n + 1, a[i]) - v + 1;
	for (int i = 0; i <= n; ++i) {
		for (int j = a[i]; j; j &= j - 1) ans += bit[j];
		for (int j = a[i]; j <= n + 1; j += j & -j) ++bit[j];
	}
	std::cout << ans << '\n';
	return 0;
}