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;

#define pb push_back
const int N = 2e5L + 11;
using ll = long long;
ll a[N], sum[N];

ll k;
ll ans = 0;
void solve(int l, int r) {
	if(l + 1 == r) return;
	int m = (l + r) / 2;
	vector <pair <ll, int>> v;
	for(int i = l; i < m; i ++)
		v.pb({sum[i] - i * k, 0});
	for(int i = m; i < r; i ++)
		v.pb({sum[i] - i * k, 1});
	sort(v.begin(), v.end());

	int acc = 0;
	for(auto i : v)
		if(i.second == 1)
			ans += acc;
		else
			acc ++;
	solve(l, m);
	solve(m, r);
}

int main() {
	ios :: sync_with_stdio(0);
	int n; cin >> n;
	cin >> k;
	for(int i = 1; i <= n; i ++)
		cin >> a[i];
	for(int i = 1; i <= n; i ++)
		sum[i] = sum[i - 1] + a[i];
	solve(0, n + 1);
	cout << ans << '\n';
}