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<map>
#include<algorithm>
using namespace std;
typedef long long ll;
map<ll,int> t;
int cnt;
const int N=2e5+5;
int n;ll k,a[N]={0},as[N];
int bit[N]={0};
void add(int x,int val) {
    while(x<cnt) bit[x]+=val,x+=x&-x;
}
int sum(int x) {
    int s=0;while(x) s+=bit[x],x-=x&-x;return s;
}
int main() {
    scanf("%d%lld",&n,&k);
    t.clear();
    for(int i=1;i<=n;i++) scanf("%lld",a+i),a[i]-=k,a[i]+=a[i-1],as[i]=a[i];
    ll ans=0;
    sort(as+1,as+1+n);
    cnt=1;
    for(int i=1;i<=n;i++) if(!t.count(as[i])) t[as[i]]=cnt++;
    for(int i=1;i<=n;i++) {
        if(a[i]>=0) ans++;
        ans+=sum(t[a[i]]);
        add(t[a[i]],1);
    }
    printf("%lld\n",ans);
    return 0;
}
