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;

typedef pair<int64_t,int64_t> ii;
ii a[200005];
int64_t n,k,res=0,Count=1,b[200005],tree[200005];

void Update(int idx)
{
    while(idx<=Count)
    {
        tree[idx]++;
        idx+=idx&-idx;
    }
}

int64_t Query(int idx)
{
    int64_t rs=0;
    while(idx>0)
    {
        rs+=tree[idx];
        idx-=idx&-idx;
    }
    return rs;
}

int main()
{
    cin>>n>>k;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i].first;
        a[i].first+=a[i-1].first-k;
        a[i].second=i;
    }
    sort(a,a+n+1);
    b[a[0].second]=1;
    for(int i=1;i<=n;i++)
        if(a[i].first!=a[i-1].first)
            b[a[i].second]=++Count;
        else
            b[a[i].second]=Count;
    Update(b[0]);
    for(int i=1;i<=n;i++)
    {
        res+=Query(b[i]);
        Update(b[i]);
    }
    cout<<res;
}
