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 int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)

int n;
ll k;
ll a[252521];
ll b[252521]; // for za-atu
ll bit[252521]; // for fenwick-tree

// fenwick tree max size is n
ll sum(int x){
  ll ret = 0;
  while(x>0){
    ret += bit[x];
    x -= x&-x;
  }
  return ret;
}
void add(int x,ll v){
  while(x<=n){
    bit[x] += v;
    x += x&-x;
  }
}

int main(){
  scanf("%d%lld",&n,&k);
  REP(i,n)scanf("%lld",a+i+1);
  REP(i,n)a[i+1] += a[i] - k;
  n++;

  // za-atu
  REP(i,n)b[i] = a[i];
  sort(b,b+n);
  REP(i,n)a[i] = lower_bound(b,b+n,a[i])-b+1;

  // fenwick tree
  ll ans = 0;
  REP(i,n){
    ans += sum(a[i]);
    add(a[i], 1);
  }
  printf("%lld\n",ans);
  return 0;
}
