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 <cstdio>
#include <algorithm>
typedef long long ll;

int n,k,c[200005];
ll Ns,Ans;
struct Rec{ll s;int p;inline bool operator<(const Rec &o)const{return s!=o.s?s<o.s:p<o.p;}}a[200005];

void Modify(int x){for(++x;x<=n+1;x+=x&-x)++c[x];}
int Query(int x,int s=0){for(++x;x;x^=x&-x)s+=c[x];return s;}

int main()
{
    scanf("%d%d",&n,&k);
    for(int i=1,x;i<=n;++i)scanf("%d",&x),a[i]=(Rec){Ns+=x-k,i};
    std::sort(a,a+n+1);
    for(int i=0;i<=n;++i)Ans+=Query(a[i].p),Modify(a[i].p);
    return printf("%lld\n",Ans),0;
}