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 <iostream>
#include <algorithm>
#include <vector>
using namespace std;

typedef long long ll;
const int maxLen = 200002;
int N = 0;
ll num[maxLen];

ll lowbit(ll x) {
	return x & (-x);
}

ll getSum(ll x) {
	ll res = 0;
	while (x > 0) {
		res += num[x];
		x -= lowbit(x);
	}
	return res;
}

ll update(ll x, ll d) {
	while (x <= N) {
		num[x] += d;
		x += lowbit(x);
	}
	return x;
}

ll d[maxLen];
ll s[maxLen];
ll st[maxLen];

int main() {
	int k = 0;
	cin >> N >> k;
	for (int i = 1; i <= N; i++) {
		cin >> d[i];
		d[i] -= k;
		s[i] = s[i - 1] + d[i];
		st[i] = s[i];
	}
	sort(st + 1, st + N + 1);
	for (int i = 1; i <= N; i++) {
		s[i] = lower_bound(st + 1, st + N + 1, s[i]) - st;
	}
	ll res = 0;
	for (int i = 1; i <= N; i++) {
		if (st[i] >= 0) res++;
		res += getSum(s[i]);
		update(s[i], 1);
	}
	cout << res << endl;
}