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>

typedef long long ll;
const int N = 200054;

int n;
ll I, a[N], b[N];

void merge_sort(int L, int R) {
	if (L + 1 == R) return;
	int M = (L + R) / 2, i = L, j = M, c = L;
	merge_sort(L, M), merge_sort(M, R), memcpy(b + L, a + L, (R - L) << 3);
	for (; i < M && j < R; a[c++] = (b[i] <= b[j] ? b[i++] : (I += M - i, b[j++])));
	i < M ? memcpy(a + c, b + i, (M - i) << 3) : memcpy(a + c, b + j, (R - j) << 3);
}

int main() {
	int i, k;
	scanf("%d%d", &n, &k);
	for (i = 1; i <= n; ++i) scanf("%lld", a + i), a[i] += a[i - 1] - k;
	merge_sort(0, ++n), printf("%lld\n", n * (n - 1ll) / 2 - I);
	return 0;
}