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>
using namespace std;
const int N=2e5+10;
typedef long long ll;
int n,k,a[N];ll sum[N],v[N];
void add(int p){
	for (p++;p<N;p+=p&-p) a[p]++;
}
int query(int p){
	int ans=0;
	for (p++;p;p-=p&-p) ans+=a[p];
	return ans;
}
int main()
{
	scanf("%d%d",&n,&k);
	for (int i=1;i<=n;i++){
		scanf("%lld",&sum[i]);
		v[i]=sum[i]=sum[i-1]+sum[i]-k;
	}
	sort(v,v+n+1);
	for (int i=0;i<=n;i++) sum[i]=lower_bound(v,v+n+1,sum[i])-v;
	add(sum[0]);
	ll ans=0;
	for (int i=1;i<=n;i++) ans+=query(sum[i]),add(sum[i]);
	printf("%lld\n",ans);
	return 0;
}