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;
#define ll long long
#define f(i, x, n) for(int i = x; i < (int)(n); ++i)

int n, k, x[200000], fn[200001];
ll mp[200000];

inline void ad(int i) { while (i <= n)++fn[i], i += i & -i; }
inline int gt(int i) { int an = 0; while (i)an += fn[i], i ^= i & -i; return an; }

int main(){
	scanf("%d%d", &n, &k);
	ll s = 0;
	f(i, 0, n){
		scanf("%d", x + i);
		x[i] -= k;
		s += x[i];
		mp[i] = x[i] - s;
	}
	sort(mp, mp + n);
	int sz = unique(mp, mp + n) - mp;
	ll an = 0;
	s = 0;
	f(i, 0, n){
		s += x[i];
		ad(lower_bound(mp, mp + sz, x[i] - s) - mp + 1);
		an += i + 1 - gt(lower_bound(mp, mp + sz, -s) - mp);
	}
	printf("%lld\n", an);
}