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;

int main() {
  int N,K;
  cin>>N>>K;
  int A=1;
  vector<int> ni;
  while(A<=N){
    ni.push_back(A);
    A*=2;
  }
  int S=ni.size();
  vector<int64_t> seg(A*2-1);
  vector<pair<int64_t,int>> p(N);
  int64_t B=0,Z=0;
  for(int i=0;i<N;i++){
    int64_t a;
    cin>>a;
    B+=a;
    B-=K;
    p[i]=make_pair(B,i);
    if(B>=0){
      Z++;
    }
  }
  sort(p.begin(), p.end());
  for(int i=0;i<N;i++){
    int x=p[i].second;
    x++;
    int Q=A+x-2;
    while(Q>0){
      if(Q%2==1){
        Z+=seg[Q];
        Q--;
      }
      Q--;
      Q/=2;
    }
    Q=A+x-2;
    while(true){
      seg[Q]++;
      if(Q==0){
        break;
      }
      Q=(Q-1)/2;
    }
  }
  cout<<Z<<endl;
}