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;
using ll = long long;

ll bit[200001];
int N, K;

ll sum(int i) {
  ll s = 0;
  while (i > 0) {
    s += bit[i];
    i -= i & -i;
  }
  return s;
}

void add(int i, ll x) {
  while (i <= N + 1) {
    bit[i] += x;
    i += i & -i;
  }
}

int main() {
  cin >> N >> K;
  vector<ll> s(N + 1, 0);
  for (int i = 1; i < N + 1; ++i) {
    int a; cin >> a;
    s[i] = s[i - 1] + a - K;
  }
  vector<ll> st(s), c;
  sort(begin(st), end(st));
  st.erase(unique(begin(st), end(st)), end(st));
  for (auto&& x : s) c.push_back(lower_bound(begin(st), end(st), x) - begin(st));
  ll ans = 0;
  for (int i = 0; i < N + 1; ++i) {
    ans += sum(c[i] + 1);
    add(c[i] + 1, 1);
  }
  cout << ans << endl;
  return 0;
}
