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>
using namespace std;
#define MAXN 200005

int T[MAXN];

void update(int i,int v)
{
	for(i++;i<MAXN;i+=(i&-i))
		T[i] += v;
}
int getSum(int i)
{
	int v = 0;
	for(i++;i;i-=(i&-i))
		v += T[i];
	return v;
}

int N,K;
int A[MAXN];
long long sm[MAXN];
int cid[MAXN];

bool cmp(int a,int b)
{
	if(sm[a]==sm[b]) return a<b;
	return sm[a]<sm[b];
}

int main()
{
	cin >> N >> K;
	for(int i=0;i<N;i++)
	{
		cin >> A[i];
		A[i] -= K;
	}
	sm[0] = 0;
	for(int i=1;i<=N;i++)
		sm[i] = sm[i-1] + A[i-1];
	for(int i=0;i<=N;i++)
		cid[i] = i;
	sort(cid,cid+N+1,cmp);
	long long ans = 0;
	for(int i=0;i<=N;i++)
	{
		ans += getSum(cid[i]);
		update(cid[i],1);
	}
	cout << ans << '\n';
}