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;
typedef long long LL;
const int maxn = 4e5 + 10;
int a[maxn];
int len, tot; LL p[maxn];
int c[maxn];
int lowbit(int x) { return x & -x; }
void upt(int x) { while(x <= len) { c[x]++; x += lowbit(x); } }
int que(int x) { int ret = 0; while(x) { ret += c[x]; x -= lowbit(x); } return ret; }
int main()
{
	int n, k;
	scanf("%d%d", &n, &k);
	for(int i = 1; i <= n; ++i) scanf("%d", &a[i]), a[i] -= k;
	LL sum = 0;
	LL ans = 0;
	for(int i = 0; i <= n; ++i) sum += a[i], p[++tot] = sum;//, p[++tot] = sum + 1;
	sort(p + 1, p + tot + 1);
	len = unique(p + 1, p + tot + 1) - p - 1;
	sum = 0;
	for(int i = 0; i <= n; ++i)
	{
		sum += a[i];
		int x = lower_bound(p + 1, p + len + 1, sum) - p;
		ans += que(x);
		upt(x);
	}
	cout << ans << endl;
	return 0;
}