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

ll a[N];
ll tmp[N],c[N];
int n,mxd;
ll k;

int lowbit(int x){
  return x&(-x);
}

ll query(int x){
  ll ret=0;
  for(int i=x;i>=1;i-=lowbit(i)){
    ret+=c[i];
  }
  return ret;
}

void modify(int x){
  for(int i=x;i<=mxd;i+=lowbit(i)){
    c[i]++;
  }
}

int main(){
  scanf("%d%lld",&n,&k);
  for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
  for(int i=1;i<=n;i++) a[i]-=k;
  for(int i=1;i<=n;i++) a[i]+=a[i-1];
  for(int i=1;i<=n;i++) tmp[i]=a[i];
  sort(tmp+1,tmp+1+n);
  mxd=unique(tmp+1,tmp+1+n)-tmp-1;
  for(int i=1;i<=n;i++) a[i]=lower_bound(tmp+1,tmp+1+mxd,a[i])-tmp;
  ll ans=0;
  for(int i=1;i<=n;i++){
    ans+=query(a[i]);
    if(tmp[a[i]]>=0) ans++;
    modify(a[i]);
  }
  printf("%lld\n",ans);
  return 0;
}