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 <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <functional>
#pragma warning(disable : 4996)
using namespace std;
int N, K, p[200009], bit[200009]; long long a[200009];
int main() {
	scanf("%d %d", &N, &K);
	for (int i = 0; i < N; i++) scanf("%lld", &a[i + 1]), a[i + 1] += a[i] - K, p[i + 1] = i + 1;
	sort(p, p + N + 1, [](int i, int j) { return a[i] != a[j] ? a[i] < a[j] : i < j; });
	long long ret = 0;
	for (int i = 0; i <= N; i++) {
		for (int j = p[i]; j >= 1; j -= j & (-j)) ret += bit[j];
		for (int j = p[i] + 1; j <= N; j += j & (-j)) bit[j]++;
	}
	printf("%lld\n", ret);
	return 0;
}