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>
#define MAX 200005
#define INF 1000000000000007
using namespace std;
typedef long long ll;
 
ll a[MAX];
ll jun(int l, int r){
  if(r - l == 1) return 0;
  int mid = (l+r)/2;
  ll ans = 0;
  ans += jun(l, mid) + jun(mid, r);
  ll s[MAX], t[MAX];
  for(int i = l; i < mid; i++) s[i-l] = a[i];
  for(int i = mid; i < r; i++) t[i-mid] = a[i];
  s[mid-l] = INF;
  t[r-mid] = INF;
  int i = 0, j = 0;
  while(i < mid-l || j < r-mid){
    if(s[i] <= t[j]){
      a[l+i+j] = s[i];
      i++;
    }else {
      a[l+i+j] = t[j];
      ans += i;
      j++;
    }
  }
  return ans;
}

int main(){
  int n, k;
  ll s, ans;
  a[0] = 0;
  scanf("%d%d", &n, &k);
  for(int i = 0; i < n; i++){
    scanf("%lld", &s);
    a[i+1] = a[i] + s - k;
  }
  ans = jun(0, n+1);
  printf("%lld", ans);
}