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;

ll N, K;
set<pair<ll, ll>> AccIs;
ll BitMax;
vector<ll> Bit;
ll R;

void init() { Bit.resize(BitMax + 1); }
void add(ll i) {
  ++i;
  for (; i <= BitMax; i += (i & -i)) ++Bit[i];
}
ll sum(ll i) {
  ++i;
  ll res = 0;
  for (; i >= 1; i -= (i & -i)) res += Bit[i];
  return res;
}
int main() {
  cin >> N >> K;
  ll acc = 0;
  AccIs.insert(make_pair(0, 0));
  for (ll i = 0; i < N; ++i) {
    ll a;
    cin >> a;
    a -= K;
    acc += a;
    AccIs.insert(make_pair(acc, i + 1));
  }
  BitMax = N + 1;
  init();
  for (auto acci : AccIs) {
    ll i = acci.second;
    R += sum(i);
    add(i);
  }
  cout << R << endl;
  return 0;
}
