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 int long long
using namespace std;

const int MAX=2e5+5;
int n,k,a[MAX],tree[MAX];

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

int query(int idx) {
	int rs=0;
	while(idx>0) {
		rs+=tree[idx];
		idx-=idx&-idx;
	}
	return rs;
}

int32_t main() {
	//freopen("input","r",stdin);
	cin>>n>>k;
	vector<int> V;
	map<int,int> M;
	V.push_back(0);
	for(int i=1;i<=n;i++) {
		cin>>a[i];
		a[i]+=a[i-1]-k;
		V.push_back(a[i]);
	}
	sort(V.begin(),V.end());
	V.resize(unique(V.begin(),V.end())-V.begin());
	int cnt=0;
	for(int x:V)
		M[x]=++cnt;
	int rs=0;
	update(M[0]);
	for(int i=1;i<=n;i++) {
		rs+=query(M[a[i]]);
		update(M[a[i]]);
	}
	cout<<rs;
}
