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;

#define int long long

pair<int,int> arr[200005];
int ind[200005],n,k,nex=1;

int ft[200005];
inline int ls(int x){
  return x&(-x);
}
void update(int p,int v=1){
  for(;p<=200000;p+=ls(p))ft[p]++;
}
int query(int p){
  int ans=0;
  for(;p;p-=ls(p))ans+=ft[p];
  return ans;
}

int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(0);
    cin>>n>>k;
    int ans=0;
    arr[0]=make_pair(0,0);
    for(int x=1;x<=n;x++){
      cin>>arr[x].first;
      arr[x].first-=k;
      arr[x].second=x;
      if(x>0){
        arr[x].first+=arr[x-1].first;
      }
    }
    sort(arr,arr+n+1);
    for(int x=0;x<=n;x++){
      if(x>0 && arr[x].first!=arr[x-1].first)nex++;
      ind[arr[x].second]=nex;
    }
    for(int x=0;x<=n;x++){
      ans+=query(ind[x]);
      update(ind[x]);
    }
    cout<<ans;
    return 0;
}
