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;

const int N = 2e5 + 5;
typedef long long ll;

int n, k, a[N], h[N];
vector<pair<ll, int> > v;
int ft[N] = {};

int get(int x) {
	int ret = 0;
	for (++x; x; x -= x & -x) ret += ft[x];
	return ret;
}

void put(int x, int v) {
	for (++x; x < N; x += x & -x) ft[x] += v;
}

int main(void) {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n >> k;
	ll sum = 0;
	ll ans = 0;
	for (int i = 0; i < n; ++i) {
		cin >> a[i];
		sum += a[i] - k;
		if (sum >= 0) ++ans;
		v.push_back({sum, i});
	}
	sort(v.begin(), v.end());
	h[v[0].second] = 0;
	for (int i = 1; i < n; ++i) {
		h[v[i].second] = i;
		if (v[i - 1].first == v[i].first)
			h[v[i].second] = h[v[i - 1].second];
	}
	for (int i = 0; i < n; ++i) {
		ans += get(h[i]);
		put(h[i], 1);
	}
	cout << ans << endl;
	return 0;
}