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 <cstdio>
#include <algorithm>

#define maxn 200010
int n, k, hcnt;
long long a[maxn], hash[maxn];
int bit[maxn];
#define lowbit(x) ((x) & -(x))
void add(int x)
{
	for (; x <= hcnt; x += lowbit(x)) ++bit[x];
}
int query(int x)
{
	int ret = 0;
	for (; x; x -= lowbit(x)) ret += bit[x];
	return ret;
}
int main()
{
	int n, k; scanf("%d%d", &n, &k);
	hash[++hcnt] = 0;
	for (int i = 1; i <= n; ++i)
		scanf("%lld", a + i), a[i] = a[i - 1] + a[i] - k, hash[++hcnt] = a[i];
	std::sort(hash + 1, hash + hcnt + 1);
	hcnt = std::unique(hash + 1, hash + hcnt + 1) - hash - 1;
	long long ans = 0;
	for (int i = 0; i <= n; ++i)
	{
		int ai = std::lower_bound(hash + 1, hash + hcnt + 1, a[i]) - hash;
		ans += query(ai);
		add(ai);
	}
	printf("%lld\n", ans);
	return 0;
}