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<cstdlib>
#define ll long long
#define N 200086
using namespace std;
int n,k;
ll ans,a[N],tmp[N];
void solve(int l,int r)
{
    if(l==r)return;
    int mid=(l+r)/2;solve(l,mid);solve(mid+1,r);
    int i=l,j=mid+1,t=l;
    while(i<=mid&&j<=r)
        if(a[i]<=a[j])tmp[t++]=a[i++];else{
            tmp[t++]=a[j++];ans+=(i-l);
        }
    while(i<=mid)tmp[t++]=a[i++];
    while(j<=r){tmp[t++]=a[j++];ans+=(i-l);}
    for(int i=l;i<=r;i++)a[i]=tmp[i];
}
int main()
{
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++)scanf("%lld",&a[i]);
    for(int i=1;i<=n;i++)a[i]+=(a[i-1]-k);
    solve(0,n);
    cout<<ans<<endl;
    return 0;
}
