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;

typedef pair<long long,int> P;

int n;
vector<long long> bit(200010,0);
void add(int a, int w) {
	for (int x = a;x <= n;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() {
	int k;
	long long ans = 0;
	vector<int> s;
	cin >> n >> k;
	vector<P> a(n+1);
	for (int i = 1;i <= n;++i) {
		cin >> a[i].first;
		a[i].first -= k;
		a[i].second = i;
	}
	a[0] = P(0,0);
	for (int i = 0;i < n;++i) a[i+1].first += a[i].first;
	
	sort(a.begin(),a.end());

	n++;
	for (int i = n;i > 0;--i) {
		ans += sum(n)-sum(a[i-1].second+1);
		add(a[i-1].second+1,1);
	}

	cout << ans << endl;
		
	return 0;
}