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
using namespace std;
typedef long long ll;
int n;
ll k,d[maxn],s[maxn],ans;
ll f[maxn];
struct node {
	int id;
	ll v;
} e[maxn];
bool cmp(node a,node b) {
	if (a.v<b.v)
		return 1;
	else if (a.v>b.v)
		return 0;
	else return a.id<b.id;
}
void update(int a) {
	while (a<=n) {
		f[a]+=1;
		a+=a&(-a);
	}
}
ll query(int a) {
	ll s=0;
	while (a>0) {
		s+=f[a];
		a-=a&(-a);
	}
	return s;
}
int main() {
	scanf("%d %lld",&n,&k);
	for (int i=1;i<=n;i++)
		scanf("%lld",&d[i]);
	s[0]=0;
	for (int i=1;i<=n;i++)
		s[i]=s[i-1]+d[i];
	for (int i=1;i<=n;i++) {
		e[i].id=i;
		e[i].v=s[i]-i*k;
	}
	sort(e+1,e+(n+1),cmp);
	for (int i=1;i<=n;i++) {
		ans+=query(e[i].id);
		update(e[i].id);
	}
	for (int i=1;i<=n;i++)
		if (e[i].v>=0)
			ans++;
	printf("%lld\n",ans);
	return 0;
}