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 <iostream>
#include <algorithm>
using namespace std;

typedef long long LL;
const int N = 2e5 + 5;

LL pre[N], tab[N];

int bit[N];

inline void add(int x) {
  for (; x < N; x += x & (- x)) bit[x] ++;
}

inline int sum(int x) {
  int ret = 0;
  for (; x > 0; x -= x & (- x)) ret += bit[x];
  return ret;
}

int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i ++) {
    scanf("%lld", &pre[i]);
    pre[i] -= k;
    pre[i] += pre[i - 1];
    tab[i] = pre[i];
  }
  sort(tab, tab + n + 1);
  LL ans = 0;
  for (int i = 0, p; i <= n; i ++) {
    p = lower_bound(tab, tab + n + 1, pre[i]) - tab + 1;
    ans += sum(p);
    add(p);
  }
  printf("%lld\n", ans);
  return 0;
}
