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>
#define ll long long
using namespace std;

const int N=4e5+5;
int n,k,now,c[N],b[N];
ll s,ans;
struct A{ ll x; int id; }a[N];

bool cmp(A i,A j) {
    return i.x<j.x;
}

inline void add(int x) {
    for(int i=x;i<=now;i+=i&-i) {
        c[i]++;
    }
}

inline int ask(int x) {
    int ret=0;
    for(int i=x;i;i-=i&-i) {
        ret+=c[i];
    }
    return ret;
}

int main() {
    scanf("%d%d",&n,&k);
    a[0]=(A){0,0};
    for(int i=1;i<=n;i++) {
        int x; scanf("%d",&x);
        s+=x;
        a[i]=(A){s-(ll)k*i,i};
    }
    sort(a,a+n+1,cmp);
    b[a[0].id]=now=1;
    for(int i=1;i<=n;i++) {
        if(a[i].x!=a[i-1].x) {
            now++;
        }
        b[a[i].id]=now;
    }
    for(int i=0;i<=n;i++) {
        ans+=ask(b[i]),add(b[i]);
    }
    printf("%lld\n",ans);
    return 0;
}