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<algorithm>
#include<iostream>
#include<vector>
using namespace std;
typedef long long lint;
typedef vector<int>vi;
typedef pair<int,int>pii;
typedef pair<lint,int>pli;
#define rep(i,n)for(int i=0;i<(int)(n);++i)
const int N=210000;
int bit[N];
void add(int i,int x){
  while(i<N){
    bit[i]+=x;
    i+=i&-i;
  }
}

int accum(int i){
  int ans=0;
  while(i>0){
    ans+=bit[i];
    i&=i-1;
  }
  return ans;
}

int main(){
  int n;
  lint k;
  cin>>n>>k;
  vector<lint>a(n);
  rep(i,n)cin>>a[i];
  rep(i,n)a[i]-=k;
  vector<lint>c(n+1);
  rep(i,n)c[i+1]=c[i]+a[i];
  vector<pli> p(n+1);
  rep(i,n+1)p[i]=pli(c[i],i+1);
  sort(p.begin(),p.end());
  lint ans=0;
  rep(i,n+1){
    int v=p[i].second;
    ans+=accum(v-1);
    add(v,1);
  }
  cout<<ans<<endl;
}
