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;
long long arr[200000+10];
long long a[200000+10];
long long n,k;
long long ans = 0;
void Merge(int l,int mid,int r)
{
    int i=l,j=mid+1,k=l;
    while(i<=mid&&j<=r)
    {
        if(arr[i]>arr[j])
        {
            a[k++]=arr[j++];
            ans+=mid-i+1;
        }
        else
		{
			a[k++]=arr[i++];
		}
    }
    while(i<=mid)
        a[k++]=arr[i++];
    while(j<=r)
        a[k++]=arr[j++];
    for(int e=l;e<=r;e++)
        arr[e]=a[e];
}
void Merge_sort(int l,int r)
{
    if(l<r)
    {
        int mid=(l+r)/2;
        Merge_sort(l,mid);
        Merge_sort(mid+1,r);
        Merge(l,mid,r);
    }
}
int main()
{
	scanf("%lld%lld",&n,&k);
	arr[0] = 0;
	for(int i=1;i<=n;i++)
	{
		scanf("%lld",&arr[i]);
		arr[i] += arr[i-1] - k;
	}
	Merge_sort(0,n);
	printf("%lld\n",(n*n+n)/2-ans);
	return 0;
}