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;
#define ll long long

const int N=2e5+5;
int n;
ll k,bit[N],pf[N];

void upd(int x){
	for(;x<N;x=x|(x+1))
		bit[x]++;
}

ll get(int x){
	ll res=0;
	for(;x>=0;x=(x&(x+1))-1)
		res+=bit[x];
	return res;
}

int main() {
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n>>k;
	vector<ll> b;
	for(int i=1;i<=n;++i){
		cin>>pf[i];
		pf[i]+=pf[i-1];
		b.push_back(pf[i]-1LL*k*i);
	}
	b.push_back(0);
	sort(b.begin(),b.end());
	ll res=0;
	upd(lower_bound(b.begin(),b.end(),0)-b.begin());
	for(int i=1;i<=n;++i){
		int x=lower_bound(b.begin(),b.end(),pf[i]-1LL*k*i)-b.begin();
		res+=get(x);
		upd(x);
	}
	cout<<res<<'\n';
}


