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>
typedef long long ll;

int s[200005],n,k,c;
ll p[200005],x[200005],ans;

int lowbit(int x){return x&-x;}
void add(int x){while(x<=c)++s[x],x+=lowbit(x);}
int sum(int x){int r=0;while(x)r+=s[x],x-=lowbit(x);return r;}

int main()
{
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;++i)
	scanf("%lld",&p[i]),x[i]=p[i]+=p[i-1]-k;

    std::sort(x+1,x+n+2);
    c=std::unique(x+1,x+n+2)-x-1;

    for(int i=1;i<=c;++i)
	if(!x[i]){add(i);break;}
    for(int i=1;i<=n;++i)
    {
	p[i]=std::lower_bound(x+1,x+c+1,p[i])-x;
	ans+=sum(p[i]),add(p[i]);
    }

    printf("%lld\n",ans);
    
    return 0;
}
