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;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a.at(i);
    a.at(i) -= k;
  }
  
  vector<int64_t> s(n + 1);
  for (int i = 0; i < n; i++) {
    s.at(i + 1) = s.at(i) + a.at(i);
  }
  
  vector<int64_t> r = s;
  sort(r.begin(), r.end());
  
  vector<int> p(n + 1);
  for (int i = 0; i <= n; i++) {
    p.at(i) = lower_bound(r.begin(), r.end(), s.at(i)) - r.begin();
    assert(p.at(i) <= n);
  }
  
  int64_t ans = 0;
  vector<int> t(n + 2);
  for (int i = 0; i <= n; i++) {
    int index = p.at(i) + 1;
    while (index) {
      ans += t.at(index);
      index -= index & -index;
    }
    index = p.at(i) + 1;
    while (index < t.size()) {
      t.at(index)++;
      index += index & -index;
    }
  }
  
  cout << ans << endl;
}
