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<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#define ll long long
using namespace std;

const int N=200005;

int n,sz,k;
ll ans;
int a[N],f[N];
ll b[N],s[N],g[N];

void add(int x){
	for (;x<=sz;x+=x&-x) f[x]++;
}

int query(int x){
	int s=0;
	for (;x;x-=x&-x) s+=f[x];
	return s;
}

int main(){
	int i;
	scanf("%d%d",&n,&k);
	g[0]=0; b[++sz]=g[0];
	for (i=1;i<=n;i++){
		scanf("%d",&a[i]);
		s[i]=s[i-1]+1ll*a[i];
		g[i]=b[++sz]=s[i]-1ll*i*k;
	}
	sort(b+1,b+1+sz);
	sz=unique(b+1,b+1+sz)-b-1;
	for (i=0;i<=n;i++) a[i]=lower_bound(b+1,b+1+sz,g[i])-b;
	add(a[0]);
	for (i=1;i<=n;i++){
		ans+=1ll*query(a[i]);
		add(a[i]);
	}
	printf("%lld\n",ans);
	return 0;
}