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>
#define N 500005
using namespace std;
long long a[N],sum[N],n,k,disc[N],ans=0,c[N];
int lowbit(int x){return x&-x;}
void add(int x){for (int i=x;i<=n+2;i=i+lowbit(i)) c[i]++;}
int getsum(int x){int ans=0;for (int i=x;i;i=i-lowbit(i)) ans=ans+c[i];return ans;}
int main()
{
	scanf("%lld%lld",&n,&k);
	for (int i=1;i<=n;i++) scanf("%lld",&a[i]),a[i]=a[i]-k;
	for (int i=1;i<=n;i++) sum[i]=sum[i-1]+a[i]; sum[0]=0;
	for (int i=0;i<=n;i++) disc[i]=sum[i]; sort(disc,disc+n+1);
	int tot=unique(disc,disc+n+1)-disc-1;
	for (int i=0;i<=n;i++) sum[i]=lower_bound(disc,disc+tot+1,sum[i])-disc;
	for (int i=0;i<=n;i++) sum[i]++; add(sum[0]);
	for (int i=1;i<=n;i++){ans=ans+getsum(sum[i]);add(sum[i]);} printf("%lld\n",ans);
	return 0;
}