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 <cstdio>
#include <algorithm>

typedef long long i64;

const int N = 200000 + 10;

int n, k, m;
int a[N], b[N];

i64 sorted[N];

int bit[N];

void add(int p) {
  for (; p <= m; p += p & -p) ++bit[p];
}

int query(int p) {
  int res = 0;
  for (; p; p ^= p & -p) res += bit[p];
  return res;
}

int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; ++i) scanf("%d", &a[i]), a[i] -= k;
  static i64 sum[N];
  for (int i = 1; i <= n; ++i) sorted[i] = sum[i] = sum[i - 1] + a[i];
  sorted[m = n + 1] = 0;
  std::sort(sorted + 1, sorted + m + 1);
  m = std::unique(sorted + 1, sorted + m + 1) - sorted - 1;
  for (int i = 0; i <= n; ++i) b[i] = std::lower_bound(sorted + 1, sorted + m + 1, sum[i]) - sorted;
  i64 ans = 0;
  for (int i = 1; i <= n; ++i) {
    add(b[i - 1]);
    ans += query(b[i]);
  }
  printf("%lld\n", ans);
  return 0;
}
