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>

#define mp make_pair
#define pb push_back

using namespace std;

int n, k;
int a[222222];
pair<long long, int> b[222222];
int bit[222222];

int que(int x){
	int an = 0;
	for(int i = x; i > 0; i -= (i & -i))
		an += bit[i];
	return an;
}

void upd(int x){
	for(int i = x; i <= n + 1; i += (i & -i))
		++bit[i];
}

int main(){
//	freopen("input.inp", "r", stdin);
	scanf("%d%d",&n,&k);
	for(int i = 0; i < n; ++i) scanf("%d",&a[i]);
	b[0].second = 1;
	for(int i = 1; i <= n; ++i){
		b[i].second = i + 1;
		b[i].first = b[i - 1].first - k + a[i - 1];
	}
	sort(b, b + n + 1);
	long long an = 0;
	for(int i = 0; i <= n; ++i){
		an += que(b[i].second - 1);
		upd(b[i].second);
	}
	printf("%lld",an);
	return 0;
}