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 <vector>
#include <queue>
#include <bitset>
#include <stack>
#include <set>
using namespace std;

typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P2;
const int inf=1000000000;
ll d[200009]={};
int n;
void addx(int k1,ll m){
	while(k1<n+2){
		d[k1]+=m;
		k1+=k1&-k1;
	}
	return;
}
int sumx(int k1){
	int r=0;
	while(k1>0){
		r+=d[k1];
		k1-=k1&-k1;
	}
	return r;
}

int main() {
	ll k;
	cin>>n>>k;

	ll a[200001]={};
	vector<ll> v;
	ll t=0;
	for(int i=0;i<n;++i){
		cin>>a[i];
		t+=a[i]-k;
		v.push_back(t);
	}
	sort(v.begin(),v.end());
	ll c=0;
	t=0;
	for(int i=0;i<n;++i){
		t+=a[i]-k;
		if(t>=0)c++;
		auto it=upper_bound(v.begin(),v.end(),t);
		int x=it-v.begin();
		c+=sumx(x);
		addx(x,1);
	}
	cout<<c<<endl;
	return 0;
}
