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;

long long N,K,ans=0;
vector<long long> a;
vector<long long> sum(1,0);
vector<long long> b;
long long bit[222222];

void add(long long a,long long w){
	for(long long x=a;x<=N+1;x+=x&-x)bit[x]+=w;
}

long long bit_sum(long long a) {
	long long ret=0;
	for(long long x=a;x>0;x-=x&-x)ret+=bit[x];
	return ret;
}

int main(){
	cin >> N >> K;
	for(int i=0;i<N;i++){
		long long tmp;
		cin >> tmp;
		a.push_back(tmp);
	}
	for(int i=0;i<N;i++){
		sum.push_back(sum[i]+a[i]);
	}
	for(int i=0;i<=N;i++){
		b.push_back(sum[i]-i*K);
	}
	vector<pair<long long,long long>> bb(N+1);
	for(int i=0;i<=N;i++){
		bb[i].first=b[i];
		bb[i].second=i+1;
	}
	sort(bb.begin(),bb.end());
	
	for(auto BB:bb){
		ans+=bit_sum(BB.second);
		add(BB.second,1LL);
	}
	
	cout << ans << endl;
	return 0;
}