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;
 
typedef long long LL;
typedef pair<LL, int> II;

const int N = (int) 2e5 + 10;
int n, k, a[N];
II s[N];
int ft[N];

void Update(int i) {
	while (i <= n) {
		ft[i]++;
		i += i & -i;
	}
}

int Query(int i) {
	int ans = 0;
	while (i) {
		ans += ft[i];
		i -= i & -i;
	}
	return ans;
}

int main() {
	scanf("%d%d", &n, &k); n++;
	for (int i = 2; i <= n; ++i) scanf("%d", &a[i]);
	for (int i = 1; i <= n; ++i) s[i] = II(s[i - 1].first + a[i] - k, i);

	LL ans = 0; sort(s + 1, s + 1 + n);
	for (int i = 1; i <= n; ++i) {
		ans += Query(s[i].second);
		Update(s[i].second);
	}
	cout << ans;
	return 0;
}