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 <cstdio>
#include <algorithm>
#define S second
using namespace std;
typedef long long ll;

ll n, k, a, s, ans, tr[200005];
pair<ll, ll> b[200005];

ll qry(ll p) {
	ll re = 0;
	for(; p; p -= p & -p) re += tr[p];
	return re;
}

void upd(ll p) {
	for(; p<=n+1; p += p & -p) tr[p]++;
}

int main() {
	ll i, j;
	cin >> n >> k;
	for(i=1; i<=n; i++) {
		scanf("%lld", &a);
		s += a;
		b[i] = {s-k*i, i};
	}
	sort(b, b+n+1);
	for(i=0; i<=n; i++) {
		ans += qry(b[i].S);
		upd(b[i].S + 1);
	}
	cout << ans;
	return 0;
}
