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 maxn 200010
#define lowb(x) (x & (-x))
int t[maxn], n, c[maxn], d[maxn];
long long a[maxn], b[maxn];
void add(int x) {
	for (int i = x; i <= n + 1; i += lowb(i)) {
		t[i]++;
	}
}
long long query(int x) {
	long long s = 0;
	for (int i = x; i > 0; i -= lowb(i)) {
		s += t[i];
	}
	return s;
}
int cmp(int i, int j) {
	return b[i] < b[j];
}
int main()
{
	int k;
	
	scanf("%d%d", &n, &k);
	for (int i = 1; i <= n; i++) {
		scanf("%lld", &a[i]);
	}
	b[0] = 0;
	c[0] = 0;
	for (int i = 1; i <= n; i++) {
		c[i] = i;
		b[i] = b[i - 1] + a[i] - k;
	}
	stable_sort(c, c + n + 1, cmp);
	for (int i = 0; i <= n; i++) {
		d[c[i]] = i + 1;
	}
	long long s = 0;
	for (int i = 0; i <= n; i++) {
		s += query(d[i]);
		add(d[i]);
	}
	printf("%lld\n", s);
}