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;

const int N = 234567;

int bit[N];

void add(int p, int v) {
  for (int i = p; i < N; i += i & -i)
    bit[i] += v;
}

int sum(int p) {
  int res = 0;
  for (int i = p; i > 0; i -= i & -i)
    res += bit[i];
  return res;
}

LL pre[N];

int main() {
  int n, k;
  scanf("%d %d", &n, &k);
  vector <LL> v;
  for (int i = 1; i <= n; i ++) {
    int a;
    scanf("%d", &a);
    a -= k;
    v.push_back(pre[i] = pre[i - 1] + a);
  }
  v.push_back(0);
  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()), v.end());
  LL ans = 0;
  int pos = upper_bound(v.begin(), v.end(), 0) - v.begin();
  add(pos, 1);
  for (int i = 1; i <= n; i ++) {
    int a = upper_bound(v.begin(), v.end(), pre[i]) - v.begin();
    ans += sum(a);
    add(a, 1);
  }
  cout << ans << endl;

}