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;

long long N, K;
int BIT[1<<20];
long long A[1<<20];
long long B[1<<20];

long long query(int idx) {
	long long ans = 0;
	while(idx) {
		ans += BIT[idx];
		idx -= (idx & -idx);
	}
	return ans;
}

void update(int idx) {
	while(idx <= N+1) {
		BIT[idx] += 1;
		idx += (idx & -idx);
	}
}

int main() {
	cin>>N>>K;
	for(int i = 1;i <= N;i++) {
		cin>>A[i];
		A[i] += A[i-1];
	}
	for(int i = 1;i <= N;i++) {
		A[i] -= i*K;
		B[i] = A[i];
	}
	
	sort(B, B+N+1);
	int sz = unique(B, B+N+1) - B;
	
	long long ans = 0;
	for(int i = 0;i <= N;i++) {
		int x = lower_bound(B, B + sz, A[i]) - B + 1;
		ans += query(x);
		update(x);
	}
	cout<<ans<<endl;
	
	return 0;
}