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<iomanip>
//#include<cstdio>
#include<vector>
#include<map>
#include<queue>
#include<algorithm>
#include<cmath>
#include<cassert>
using namespace std;
typedef long long ll;
const int Nmax = 2e5;
int N;
ll K;
ll A[Nmax];

int main(){
	cin >> N >> K;
	for(int i=0; i<N; i++){
		cin >> A[i];
	}

	vector<ll> b(N+1), d(N+1);
	b[0] = 0;
	for(int i=0; i<N; i++){
		b[i+1] = b[i]+A[i]-K;
	}
	d = b;
	sort(d.begin(), d.end());

	vector<int> c(N+1);
	for(int i=0; i<=N; i++){
		c[i] = lower_bound(d.begin(), d.end(), b[i]) - d.begin();
	}

	vector<int> bit(N+2);
	ll ans = 0;
	for(int i=0; i<=N; i++){
		for(int k=c[i]+1; k>0; k-=k&-k){
			ans += bit[k];
		}
		for(int k=c[i]+1; k<=N+1; k+=k&-k){
			bit[k] += 1;
		}
	}

	cout << ans << endl;

	return 0;
}
