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;

const int MAX = 200005;
long long A[MAX], B[MAX];

int N;
long long BIT[MAX];
void add(int a, long long w) {
    for (int x = a; x <= N+1; x += x & -x) BIT[x] += w;
}
long long sum(int a) {
    long long ret = 0;
    for (int x = a; x > 0; x -= x & -x) ret += BIT[x];
    return ret;
}

int main() {
    int K;
    long long a;
    scanf("%d %d", &N, &K);
    A[0] = B[0] = 0;
    for (int i = 1; i <= N; i++) {
        scanf("%lld", &a);
        A[i] = A[i-1] + a - K;
        B[i] = A[i]; 
    }
    sort(B, B+N+1);
    long long ans = 0;
    for (int i = 0; i <= N; i++) {
        int p = distance(B, lower_bound(B, B+N+1, A[i]));
        ans += sum(p+1);
        add(p+1, 1ll);
    }
    printf("%lld\n", ans);
    return 0;
}