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 <iostream>
#include <algorithm>
#include <utility>
#define llint long long

using namespace std;

llint N, K;
llint a[200005];
llint sum[200005];
pair<llint, int> p[200005];

llint bit[200005];

void init()
{
	for(int i = 1; i <= N+1; i++) bit[i] = 0;
}

llint query(llint i)
{
	i++;
	llint ret = 0;
	while(i > 0){
		ret += bit[i];
		i -= i & (-i);
	}
	return ret;
}

void add(llint i, llint val)
{
	i++;
	while(i <= N+1){
		 bit[i] += val;
		i += i & (-i);
	}
}

int main(void)
{
	cin >> N >> K;
	for(int i = 1; i <= N; i++){
		cin >> a[i];
		a[i] -= K;
	}
	
	for(int i = 1; i <= N; i++) sum[i] = sum[i-1] + a[i];
	for(int i = 0; i <= N; i++) p[i] = make_pair(sum[i], i);
	sort(p, p+N+1);
	
	llint ans = 0;
	for(int i = 0; i <= N; i++){
		ans += query(p[i].second);
		add(p[i].second, 1);
	}
	
	cout << ans << endl;
	return 0;
}