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<algorithm>
#define N 202000
using namespace std;
long long n,k,tree[N],sum[N],f[N],m,ans;
long long lowbit(int x){return x&-x;}
void add(int x,int k)
{
    while(x<=n)
    {
        tree[x]+=k;
        x+=lowbit(x);
    }
}
long long query(int x)
{
    int ans=0;
    while(x>0)
    {
        ans+=tree[x];
        x-=lowbit(x);
    }
    return ans;
}
int main()
{
    ios::sync_with_stdio(false);
    cin>>n>>k;
    for(int i=1;i<=n;++i)
        cin>>sum[i];
    for(int i=1;i<=n;++i)
        f[i]=sum[i]+=sum[i-1]-k;
    for(int i=1;i<=n;++i)
        if (sum[i]>=0) ans++;
    sort(f+1,f+n+1);
    m=unique(f+1,f+n+1)-f-1;
    for(int i=1;i<=n;++i)
        sum[i]=lower_bound(f+1,f+m+1,sum[i])-f;
    for(int i=n;i>=1;--i)
    {
        ans+=query(sum[i]);
        add(1,1);add(sum[i]+1,-1);
    }
    cout<<ans<<endl;
    return 0;
}