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 <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
const int maxn = 200005;
int N, K, n;
ll s[maxn], v[maxn];
int c[maxn];
void add(int p) {
    for(; p<=n+1; p+=p&-p) c[p] += 1;
}
ll query(int p) {
    ll ans = 0;
    for(; p; p-=p&-p) ans += c[p];
    return ans;
}
int main() {
    scanf("%d%d", &N, &K);
    s[0] = 0;
    for(int i=1, a; i<=N; ++i) {
	scanf("%d", &a);
	s[i] = s[i-1]+a-K;
    }
    for(int i=0; i<=N; ++i) v[i] = s[i];
    sort(v, v+N+1);
    n = unique(v, v+N+1)-v-1;
    for(int i=0; i<=N; ++i)
	s[i] = lower_bound(v, v+n+1, s[i])-v+1;
    ll ans = 0;
    add(s[0]);
    for(int i=1; i<=N; ++i) 
	ans += query(s[i]), add(s[i]);
    printf("%lld\n", ans);
    return 0;
}
