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>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<ll,ll> P;
#define pb push_back
#define mp make_pair
#define ft first
#define sd second
#define fr(i,n) for(int i=0;i<n;i++)
#define Fr(i,n) for(int i=0;i++<n;)
#define ifr(i,n) for(int i=n-1;i>=0;i--)
#define iFr(i,n) for(int i=n;i>0;i--)

ll bit[200010]={},n;
 
ll sum(ll i){
  ll s=0;
  while(i>0){
    s+=bit[i];
    i-=i&-i;
  }
  return s;
}
 
void add(ll i,ll x){
  while(i<=n+1){
    bit[i]+=x;
    i+=i&-i;
  }
}

int main(){
  ll k,a[200010],ans=0,s[200010]={};
  P p[200010]={};
  cin>>n>>k;
  fr(i,n){cin>>a[i];a[i]-=k;s[i+1]=s[i]+a[i];}
  Fr(i,n+1) p[i]=mp(s[i-1],i);
  sort(p+1,p+n+2);
  Fr(i,n+1){
    ans+=sum(p[i].sd);
    //cout<<i<<" "<<p[i].sd<<endl;
    add(p[i].sd,1);
    //cout<<i<<" "<<p[i].sd<<endl;
  }
  cout<<ans<<endl;
}