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;
long long a[200005];
long long b[200005];
//     val   ,  pos
map<long long, vector<long long> > memo;

int bit[200005];

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

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


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

	long long sumi = 0;
	for(long long i = 0; i < N; i++){
		memo[sumi - i * K].push_back(i);
		//b[i] = sumi - i * K;
		sumi += a[i];
	}
	//b[N] = sumi - N * K;
	memo[sumi - N * K].push_back(N);

	for(auto me: memo){
		vector<long long> pos = me.second;
		for(long long i = 0; i < pos.size(); i++){
			ans += sum(pos[i]+1);
			add(pos[i]+1, 1);
		}
	}
	cout << ans << endl;
}
