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<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long ll;

int n;
ll k;
const int N = 2e5+5;
ll a[N],b[N];
map<ll,int> c;

int bit[N];

void ud(int i, int v) {
	for(;i < N; i+=i&-i)
		bit[i] += v;
}

int qr(int i) {
	int b=0;
	for(;i;i^=i&-i)
		b += bit[i];
	return b;
}

int main() {
	scanf("%d%lld",&n,&k);
	for(int i = 1; i <= n; ++i) {
		scanf("%lld",a+i);
		a[i] -= k;
	}
	for(int i = 1; i <= n; ++i) {
		a[i] += a[i-1];
	}
	for(int i = 1; i <= n; ++i) {
		b[i] = a[i];
	}
	sort(b,b+n+1);
	for(int i = 0; i <= n; ++i) {
		c[b[i]] = i+1;
	}
	ll ans = 0;
	for(int i = n; i >= 1; --i) {
		ud(c[a[i]],1);
		// cout << i << " : " << c[a[i]] << " " << c[a[i-1]] << endl;
		ans += qr(n+1) - qr(c[a[i-1]]-1);
		// cout << ans << endl;
	}
	printf("%lld\n",ans);
	return 0;
}