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 nm = 2e5;
int n, k, inf, sup, mid, bit[nm + 2];
long long b[nm + 1], c[nm + 1], ans;
void add(int i) {
	for (int j = i; j <= n + 1; j += j & -j) {
		bit[j]++;
	}
}
long long sum(int i) {
	long long rv = 0;
	for (int j = i; j > 0; j -= j & -j) {
		rv += bit[j];
	}
	return rv;
}

int main() {
	cin >> n >> k;
	for (int i = 0, a; i < n; i++) {
		cin >> a;
		b[i + 1] = b[i] + a - k;
		c[i + 1] = b[i + 1];
	}
	sort(c, c + n + 1);
	for (int i = 0; i < n + 1; i++) { //b[i] <- index of b[i] in c
		inf = 0, sup = n + 1;
		while (sup - inf > 1) {
			mid = (inf + sup) / 2;
			if (c[mid] <= b[i])
				inf = mid;
			else
				sup = mid;
		}
		b[i] = sup;
	}
	for (int i = 0; i < n + 1; i++) {
		ans += sum(b[i]);
		add(b[i]);
	}
	cout << ans << endl;
}
